Approximation algorithms for the parallel flow shop problem
Year of publication: |
2012
|
---|---|
Authors: | Zhang, Xiandong ; Velde, Steef L. van de |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 216.2012, 3 (1.2.), p. 544-552
|
Subject: | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Operations Research | Operations research |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Exact and approximation algorithms for the operational fixed interval scheduling problem
Van Wassenhove, Luk N., (1992)
- More ...
-
Tactical fixed job scheduling with spread-time constraints
Zhou, Shuyu, (2014)
-
Polynomial-time approximation schemes for scheduling problems with time lags
Zhang, Xiandong, (2010)
-
Increasing the revenue of self-storage warehouses by optimizing order scheduling
Zhang, Xiandong, (2016)
- More ...