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: 76−16m (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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
