Two- and three-stage flowshop scheduling with no-wait in process

T. C.Edwin Cheng, Chelliah Sriskandarajah, Guoqing Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

7 Citations (Scopus)

Abstract

In this paper we study the time complexities of some two- and three-stage no-wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP-complete.
Original languageEnglish
Pages (from-to)367-378
Number of pages12
JournalProduction and Operations Management
Volume9
Issue number4
Publication statusPublished - 1 Jan 2000
Externally publishedYes

Keywords

  • Algorithms
  • Complexity
  • Flowshop scheduling
  • Makespan minimization

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Management of Technology and Innovation

Cite this