Abstract
ABSTRACT Standard scheduling problems bear the assumption that each job has a constant setup time and thus this setup time can be included in the processing time of a job. However, many realistic production systems suggest otherwise. This paper considers a single machine scheduling problem where jobs are classified into classes and a setup is required between jobs of different classes, but not between jobs of the same class. This class setup time depends only on the current job, not on the previous job. The performance measure is the maximum lateness of jobs. Several properties of the optimal solution and a lower bound of the optimal lateness are developed to construct a branch-and-bound algorithm in the search of an optimal schedule and the effectiveness of the proposed algorithm is empirically evaluated.
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.
