Parallel machine scheduling problem with preemptive jobs and transportation delay
Year of publication: |
2014
|
---|---|
Authors: | Shams, Hesam ; Salmasi, Nasser |
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. 50.2014, p. 14-23
|
Subject: | Scheduling | Parallel machine scheduling | Transportation delay | Preemption | Minimization of makespan | Mathematical modeling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Produktionssteuerung | Production control | Branch-and-Bound | Branch and Bound |
-
Kim, Jun, (2022)
-
Liu, Guo-Sheng, (2019)
-
A unified view of parallel machine scheduling with interdependent processing rates
Alidaee, Bahram, (2019)
- More ...
-
Permutation flowshops in group scheduling with sequence-dependent setup times
Naderi, B., (2012)
-
Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems
Keshavarz, Taha, (2014)
-
Jafari, Hamed, (2015)
- More ...