Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19575
Title: Two-stage flowshop earliness and tardiness machine scheduling involving a common due window
Authors: Yeung, WK
Oguz, C
Cheng, TCE 
Keywords: Branch and bound
Due window
Dynamic programming
Earliness-tardiness
Flowshop scheduling
Heuristic
Issue Date: 2004
Publisher: Elsevier
Source: International journal of production economics, 2004, v. 90, no. 3, p. 421-434 How to cite?
Journal: International journal of production economics 
Abstract: This paper studies a non-preemptive two-stage flowshop scheduling problem to minimize the earliness and tardiness under the environment of a common due window. The window size and the window location are considered to be given parameters. The just-in-time problem exists naturally and has many practical applications. The problem is shown to be NP-complete in the strong sense. We develop a branch and bound algorithm and a heuristic to solve the problem. We conduct the computational experiments to test the performances of the algorithms. A strong lower bound is derived for the branch and bound algorithm that can efficiently solve 15 jobs problem for about 5 minutes. The heuristic is shown to be efficient and effective, which can solve the problem of 150 jobs for about 20 seconds and provide near-optimal solution. We justify that the heuristic is an excellent solution approach for large problem instances. We also show that four special cases are either polynomial solvable or NP-complete in the ordinary sense.
URI: http://hdl.handle.net/10397/19575
ISSN: 0925-5273
DOI: 10.1016/S0925-5273(03)00044-6
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

45
Last Week
0
Last month
0
Citations as of Feb 21, 2018

WEB OF SCIENCETM
Citations

42
Last Week
0
Last month
0
Citations as of Feb 22, 2018

Page view(s)

68
Last Week
0
Last month
Citations as of Feb 18, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.