Abstract
The problem of scheduling a collection of different jobs on identical parallel machines is investigated. For each job a number of unit processing time tasks, a given deadline and an upper bound on inventory are known. The optimality criterion is changeover cost which occur if different types of jobs are processed in sequence. Only unit cost are to be considered. For two job types, an efficient algorithm is presented considering only tight schedules; if more job types have to be considered the problem becomes NP-hard.
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.
