Abstract
This paper presents a job scheduling model of M identical machines in parallel. The model assumes that a significant set-up time is incurred when a machine changes from processing one type of parts to a different type of parts. A problem is examined that determines the quantity and the schedule of each part type to be processed on each machine. The objective of this problem is to minimize the total completion time. A heuristic approach and two lower bounds on the optimal completion time are presented. In addition, the efficiency of this heuristic is tested on several groups of random problems.
Sign-in/Register to access full text options 
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.
