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: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics | Produktionssteuerung | Production control | Operations Research | Operations research |
-
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak, (2024)
-
Xu, Kailiang, (2010)
-
A hybrid PSO-GA algorithm for job shop scheduling in machine tool production
Liu, Li-Lan, (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)
-
New results for minimising variation of flow time in two-machine proportionate no-wait flow shops
Panwalkar, S. S., (2021)
- More ...