Abstract
A mathematical programming model is proposed for the two parallel machines scheduling problem where one machine is periodically unavailable, jobs are non-preemptive, and the objective is minimizing the makespan. The model is established by transforming the two parallel machine setting into a single machine setting. Average-case analyses of the classical Longest Processing Time first (LPT) algorithm and the List Scheduling (LS) are presented. Computational experiments show that the LPT algorithm beats the LS algorithm in all the 96 combinations of two main parameters from an average-case error point of view and that the average-case error of the LPT algorithm is less than 2% when the number of jobs is greater than twenty. Unexpectedly, there also exist instances showing that the LS algorithm may beat the LPT algorithm from the average-case error point of view.
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.
