Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Year of publication: |
2012
|
---|---|
Authors: | Kasperski, Adam ; Kurpisz, Adam ; Zieliński, Paweł |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 217.2012, 1 (16.2.), p. 36-43
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Risiko | Risk | Fließfertigung | Assembly-line production |
-
A versatile algorithm for assembly line balancing
Boysen, Nils, (2008)
-
Scheduling of coupled tasks and one-machine no-wait robotic cells
Brauner, Nadia, (2009)
-
A memetic algorithm for the flexible flow line scheduling problem with processor blocking
Tavakkoli-Moghaddam, Reza, (2009)
- More ...
-
Approximability of the robust representatives selection problem
Kasperski, Adam, (2015)
-
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Kasperski, Adam, (2012)
-
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Kasperski, Adam, (2012)
- More ...