Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
Year of publication: |
March 2017
|
---|---|
Authors: | Khorasanian, Danial ; Moslehi, Ghasem |
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. 79.2017, p. 94-108
|
Subject: | Blocking flow shop scheduling | Multi-task flexibility | Preemption | Makespan | Variable neighborhood search | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Produktionsplanung | Production planning |
-
Chen, Huaping, (2014)
-
Akhoondi, Fateme, (2016)
-
Minimizing the makespan on two identical parallel machines with mold constraints
Chung, Tsuiping, (2019)
- More ...
-
Moslehi, Ghasem, (2014)
-
Khorasanian, Danial, (2022)
-
Moslehi, Ghasem, (2011)
- More ...