An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Year of publication: |
2012
|
---|---|
Authors: | Panwalkar, S. S. ; Koulamas, Christos |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 221.2012, 1 (16.8.), p. 7-13
|
Subject: | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Theorie | Theory | Produktionssteuerung | Production control |
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
-
Ozturk, Onur, (2012)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
- More ...
-
The two-machine no-wait general and proportionate open shop makespan problem
Panwalkar, S. S., (2014)
-
The proportionate two-machine no-wait job shop scheduling problem
Koulamas, Christos, (2016)
-
Analysis of flow shop scheduling anomalies
Panwalkar, S. S., (2020)
- More ...