Three-machine flow shop scheduling with overlapping waiting time constraints

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 242
  • Download : 0
In this paper, we examine a three-machine flow shop scheduling problem with overlapping waiting time constraints with the objective of minimizing makespan. In the problem, jobs that finish processing on the first machine must be processed on the second and third machines within designated time periods. These overlapping waiting time constraints are common scheduling requirements in semiconductor manufacturing since up to 20% of all process steps are controlled with waiting time limits to achieve better quality. We first derive dominance properties for the problem by analyzing overlapping waiting time constraints, and then we develop a branch and bound algorithm that uses these properties. An initial solution is obtained by heuristic algorithms, and seven lower bounds are proposed for the branch and bound algorithm. The performance of the algorithm is evaluated with computational tests. (C) 2018 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2019-01
Language
English
Article Type
Article
Citation

COMPUTERS & OPERATIONS RESEARCH, v.101, pp.93 - 102

ISSN
0305-0548
DOI
10.1016/j.cor.2018.06.009
URI
http://hdl.handle.net/10203/266077
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0