Abstract
We study the problem of minimizing total load on a proportionate openshop. The problem is proved to be NP-hard. A simple LPT (Longest Processing Time first)-based heuristic is proposed, and a bound on the worst-case relative error is introduced: (where m is the number of machines). The proposed bound is smaller than the classical bound on the relative error of LPT when minimizing makespan on parallel identical machines. The algorithm is tested numerically and is shown to produce very close-to-optimal schedules.
Original language | English |
---|---|
Pages (from-to) | 190-198 |
Number of pages | 9 |
Journal | Discrete Applied Mathematics |
Volume | 338 |
DOIs | |
State | Published - 30 Oct 2023 |
Bibliographical note
Publisher Copyright:© 2023
Keywords
- Heuristic
- Proportionate openshop
- Scheduling
- Total load
- Worst case bound