Abstract

Coming from the ldquojust-in-timerdquo philosophy in management and production theory, minimizing total weighted earliness-tardiness on machine scheduling problems has wide industrial applications. In the case of a single machine with a given common due date, the problem is known NP-hard. In this paper, n jobs with identical processing times should be scheduled on m uniform machines. The objective is to minimize the total weighted earliness-tardiness penalties. In this study, we consider l given due dates (l<n). We show that the scheduling problem on m uniform machines is polynomially solvable.

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 call

Disclaimer: 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.