Minimizing the makespan on two identical parallel machines with mold constraints
Year of publication: |
2019
|
---|---|
Authors: | Chung, Tsuiping ; Gupta, Jatinder N. ; Zhao, Haidan ; Werner, Frank |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 105.2019, p. 141-155
|
Subject: | Identical parallel machines | Makespan | MILP model | Heuristics | Molds as resource constraints | Wafer fabrication | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Heuristik | Algorithmus | Algorithm | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Wang, Xiuli, (2015)
-
Ozturk, Onur, (2017)
-
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne, (2015)
- More ...
-
On the solution of 2-machine flow shop problems with a common due date
Gupta, Jatinder N., (2000)
-
Intelligent decision-making support systems : foundations, applications and challenges
Gupta, Jatinder N., (2006)
-
Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
Li, Xiaoping, (2015)
- More ...