Abstract
The paper deals with the single-machine scheduling problem in which each job has a processing time and a delivery time, a set of jobs is divided into batches and a setup time is incurred whenever there is a switch from a job in one batch to a job in another batch. The objective is to find a sequence of jobs which minimizes the time by which all jobs are delivered. Two approximation algorithms with the worst-case performance ratio of 3 2 are given for the case with sequence independent batch setup times. Results of computational experiments are also provided.
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.
