Abstract
In this paper we consider a problem where N jobs are to be scheduled on a single machine and assigned to one of the two due-dates which are given at equal intervals. Tardy jobs are not allowed, thus the due-dates are deadlines. There is a linear due-date penalty and linear earliness penalty, and the sum of these penalties is to be minimized. This problem is shown to be NP-hard. One case of the problem (the unrestricted case) is shown to be easy to solve. For the restricted case, lower and upper bounds are developed. Computational experience is reported which suggests that the bounds are quite effective.
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.
