Two-stage flowshop scheduling with a common second-stage machine

Ceyda Oǧuz; Bertrand M T Lin; Edwin Tai Chiu Cheng

Two-stage flowshop scheduling with a common second-stage machine

Ceyda Oǧuz
, Bertrand M T Lin
, Edwin Tai Chiu Cheng

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

Abstract

This article considers minimizing the makespan in a two-stage flowshop scheduling problem with a common second-stage machine. After introducing the problem, we show that it is Nn P-hard and give two special cases which are polynomially solvable. Next, we propose a heuristic algorithm and analyze its worst-case error bound. We then develop some lower bounds. Finally, we perform some computational experiments to test the average performance of the proposed heuristic.

Original language	English
Pages (from-to)	1169-1174
Number of pages	6
Journal	Computers and Operations Research
Volume	24
Issue number	12
Publication status	Published - 1 Dec 1997

ASJC Scopus subject areas

Information Systems and Management
Management Science and Operations Research
Applied Mathematics
Modelling and Simulation
Transportation

Cite this

@article{a5bdcf8391ea46a3951615d0efc61f71,

title = "Two-stage flowshop scheduling with a common second-stage machine",

abstract = "This article considers minimizing the makespan in a two-stage flowshop scheduling problem with a common second-stage machine. After introducing the problem, we show that it is Nn P-hard and give two special cases which are polynomially solvable. Next, we propose a heuristic algorithm and analyze its worst-case error bound. We then develop some lower bounds. Finally, we perform some computational experiments to test the average performance of the proposed heuristic.",

author = "Ceyda Oǧuz and Lin, \{Bertrand M T\} and Cheng, \{Edwin Tai Chiu\}",

year = "1997",

month = dec,

day = "1",

language = "English",

volume = "24",

pages = "1169--1174",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - Two-stage flowshop scheduling with a common second-stage machine

AU - Oǧuz, Ceyda

AU - Lin, Bertrand M T

AU - Cheng, Edwin Tai Chiu

PY - 1997/12/1

Y1 - 1997/12/1

N2 - This article considers minimizing the makespan in a two-stage flowshop scheduling problem with a common second-stage machine. After introducing the problem, we show that it is Nn P-hard and give two special cases which are polynomially solvable. Next, we propose a heuristic algorithm and analyze its worst-case error bound. We then develop some lower bounds. Finally, we perform some computational experiments to test the average performance of the proposed heuristic.

AB - This article considers minimizing the makespan in a two-stage flowshop scheduling problem with a common second-stage machine. After introducing the problem, we show that it is Nn P-hard and give two special cases which are polynomially solvable. Next, we propose a heuristic algorithm and analyze its worst-case error bound. We then develop some lower bounds. Finally, we perform some computational experiments to test the average performance of the proposed heuristic.

UR - https://www.scopus.com/pages/publications/0031363501

M3 - Journal article

SN - 0305-0548

VL - 24

SP - 1169

EP - 1174

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 12

ER -

Two-stage flowshop scheduling with a common second-stage machine

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this