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

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

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

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

Research output: Journal article publication › Journal article › Academic research › peer-review

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 language	English
Pages (from-to)	367-378
Number of pages	12
Journal	Production and Operations Management
Volume	9
Issue number	4
Publication status	Published - 1 Jan 2000
Externally published	Yes

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

@article{d2b957dad12e4b0b86b103ee97e66e9d,

title = "Two- and three-stage flowshop scheduling with no-wait in process",

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.",

keywords = "Algorithms, Complexity, Flowshop scheduling, Makespan minimization",

author = "Cheng, {T. C.Edwin} and Chelliah Sriskandarajah and Guoqing Wang",

year = "2000",

month = jan,

day = "1",

language = "English",

volume = "9",

pages = "367--378",

journal = "Production and Operations Management",

issn = "1059-1478",

publisher = "Wiley-Blackwell",

number = "4",

}

TY - JOUR

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

AU - Cheng, T. C.Edwin

AU - Sriskandarajah, Chelliah

AU - Wang, Guoqing

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

KW - Algorithms

KW - Complexity

KW - Flowshop scheduling

KW - Makespan minimization

UR - http://www.scopus.com/inward/record.url?scp=0039339185&partnerID=8YFLogxK

M3 - Journal article

VL - 9

SP - 367

EP - 378

JO - Production and Operations Management

JF - Production and Operations Management

SN - 1059-1478

IS - 4

ER -