Abstract
We consider a single processor scheduling problem with a common due window assignment. Jobs completed within the due window incur no penalty, while other jobs incur either earliness or tardiness penalties. Boundaries of the due window are decision variables. The objective is to minimize the sum of the total weighted earliness, the total weighted tardiness and due window width penalty. This problem is an extension of the classical Weighted Earliness and Tardiness problem (WET). We proved that our problem is NP-hard and presented some properties of an optimal solution. To solve the problem we constructed a dynamic programming algorithm and a fully polynomial time approximation scheme. We also presented a polynomial time algorithm for the case with unit job 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.
