Abstract
In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the due-dates, while in the second model the due-dates are assigned using the slack due-date assignment method. The objective is to determine the optimal sequence, the optimal due-dates and the optimal processing time compressions to minimize a total penalty function based on earliness, tardiness, due-dates and compressions. We solve the problem by formulating it as an assignment problem which is polynomially solvable. For the case that all the jobs have a common upper bound for compressions and an equal unit compression penalty, we present an O( n log n) algorithm to obtain the optimal solution.
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.
