On the complexity of two-machine flowshop problems with due date related objectives Article

Koulamas, C. (1998). On the complexity of two-machine flowshop problems with due date related objectives . EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 106(1), 95-100. 10.1016/S0377-2217(98)00323-3

keywords

  • BOUND ALGORITHM
  • BRANCH
  • Business & Economics
  • JOBS
  • MINIMIZE
  • Management
  • Operations Research & Management Science
  • Science & Technology
  • Social Sciences
  • TOTAL TARDINESS
  • Technology
  • due dates
  • flowshop
  • scheduling

Digital Object Identifier (DOI)

publisher

  • ELSEVIER SCIENCE BV

start page

  • 95

end page

  • 100

volume

  • 106

issue

  • 1