A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
Year of publication: |
2013
|
---|---|
Authors: | Pan, Quan-ke ; Ruiz, Rubén |
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. 40.2013, 1, p. 117-128
|
Subject: | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research | Bibliometrie | Bibliometrics |
-
Research trends in combinatorial optimization
Weinand, Jann Michael, (2022)
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
- More ...
-
Local search methods for the flowshop scheduling problem with flowtime minimization
Pan, Quan-Ke, (2012)
-
An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem
Pan, Quan-Ke, (2014)
-
An estimation of distribution algorithm for lot-streaming flow shop problems with setup times
Pan, Quan-Ke, (2012)
- More ...