Abstract
This paper studies the single-machine due-date assignment problem with past-sequence-dependent setup times (denoted by $$ST_{psd}$$ ). Under common due-date (denoted by CON-DD) assignment, slack due-date (denoted by SLK-DD) and different due-date (denoted by DIF-DD) assignment, the objective function is to minimize the linear weighted sum of earliness-tardiness, number of early and delayed jobs, and due-date cost. Optimal properties of the problem is given and then prove that the problem can be solved in polynomial time. Three extensions to the problem are also offered by assuming position-dependent, time-dependent, position-and-time-dependent processing times.
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.
