Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
Year of publication: |
2011
|
---|---|
Authors: | Wu, Yong ; Ji, Min ; Yang, Qifan |
Published in: |
International journal of production economics. - Amsterdam [u.a.] : Elsevier, ISSN 0925-5273, ZDB-ID 1092526-0. - Vol. 135.2011, 1, p. 367-371
|
Subject: | Scheduling | Semi-online | Grade ofservice | Two machines | Competitive ratio | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
-
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Liu, Peihai, (2014)
-
Pseudo lower bounds for online parallel machine scheduling
Tan, Zhiyi, (2015)
-
Online scheduling of jobs with favorite machines
Chen, Cong, (2020)
- More ...
-
Wu, Yong, (2012)
-
Wu, Yong, (2012)
-
Facility location for a closed-loop distribution network: a hybrid approach
Ghadge, Abhijeet, (2016)
- More ...