Preemptive scheduling of two uniform parallel machines to minimize total tardiness
Year of publication: |
2012
|
---|---|
Authors: | Lushchakova, Irina N. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 219.2012, 1 (16.5.), p. 27-33
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Operations Research | Operations research | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
Minimising general setup costs in a two-stage production system
Ciavotta, Michele, (2013)
-
An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines
Xu, Shubin, (2018)
- More ...
-
Preemptive scheduling of two uniform parallel machines to minimize total tardiness
Lushchakova, Irina N., (2012)
-
Scheduling incompatible tasks on two machines
Lushchakova, Irina N., (2010)
-
A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
Lushchakova, Irina N., (2010)
- More ...