Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem
Year of publication: |
2013
|
---|---|
Authors: | Keshavarz, Taha ; Salmasi, Nasser |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 20 (15.10.), p. 6182-6193
|
Subject: | flexible flowshop scheduling | sequence-dependent group scheduling | metaheuristics | memetic algorithm | lower bound | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm |
-
A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem
Deng, Jin, (2016)
-
A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem
Li, Xiangtao, (2013)
-
Memetic algorithm for unrelated parallel machine scheduling problem with grey processing times
Arık, Oğuzhan Ahmet, (2023)
- More ...
-
Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems
Keshavarz, Taha, (2014)
-
Keshavarz, Taha, (2015)
-
Flowshop sequence-denpendent group scheduling with minimisation of weighted earliness and tardiness
Keshavarz, Taha, (2019)
- More ...