Abstract
In this paper we study the optimality of the TLS algorithm for solving the online scheduling problem of minimizing the makespan on a set of m multipurpose machines, where there are two different job types and each job type can only be processed on a unique subset of machines. The literature shows that the TLS algorithm is optimal for the special cases where either m=2 or where all processing times are restricted to unity. We show that the TLS algorithm is optimal also for the special cases where the job processing times are either job type or machine set dependent. For both cases, the optimality of the TLS algorithm is proven by showing that its competitive ratio matches the lower bound for any processing set and processing time parameters.
| Original language | English |
|---|---|
| Pages (from-to) | 198-222 |
| Number of pages | 25 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 26 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jul 2013 |
| Externally published | Yes |
Bibliographical note
Funding Information:Acknowledgements This research was partially supported by the Paul Ivanier Center for Robotics and Production Management, Ben-Gurion University of the Negev.
Funding
Acknowledgements This research was partially supported by the Paul Ivanier Center for Robotics and Production Management, Ben-Gurion University of the Negev.
| Funders | Funder number |
|---|---|
| Ben-Gurion University of the Negev |
Keywords
- Algorithm TLS
- Competitive analysis
- Makespan
- Multipurpose machines
- Online scheduling