Abstract
This paper addresses a single-machine bi-criterion scheduling problem where the jobs fall into several classes. A sequence-independent setup time is required when the process is switched from one class of jobs to another. The objective of this paper is to find an optimal schedule that minimizes the total completion time subject to a constraint that each job must finish before its deadline. An exact solution incorporating with a number of properties and a lower bound are proposed to tackle this problem, and the efficiency of the proposed procedure is then tested by computational experiments.
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.
