Reduction of permutation flowshop problems to single machine problems using machine dominance relations
| Year of publication: |
January 2017
|
|---|---|
| Authors: | Fernandez-Viagas, Victor ; Framinan, Jose M. |
| 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. 77.2017, p. 96-110
|
| Subject: | Scheduling | Flowshop | Processing times | PFSP | Makespan | Flowtime | Single machine | Dominating machine | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Produktionssteuerung | Production control | Heuristik | Heuristics | Theorie | Theory | Evolutionärer Algorithmus | Evolutionary algorithm | Künstliche Intelligenz | Artificial intelligence |
-
The optimal number of used machines in a two-stage flexible flowshop scheduling problem
Gerstl, Enrique, (2014)
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
-
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
Fernandez-Viagas, Victor, (2017)
- More ...
-
Prata, Bruno de Athayde, (2022)
-
Assembly flowshop scheduling problem : speed-up procedure and computational evaluation
Fernandez-Viagas, Victor, (2022)
-
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
Fernandez-Viagas, Victor, (2020)
- More ...