Abstract
This paper studies a due date assignment and single machine scheduling problem. In this model, the actual processing time of a job depended both on its start time and position in a sequence. Each job has to be assigned a due date by which it must be completed. The goal is to determine schedule the jobs and the due dates so as to minimize the the criteria that includes the cost of changing the due dates, the total cost of discarded jobs and the total earliness of the scheduled jobs. For the proposed problems, polynomial-time algorithms are presented separately for the CON and SLK due-date assignment method versions.
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.
