Abstract
In the due date assignment, the bicriteria scheduling models are motivated by the trade-off between the due date assignment cost and a performance criterion of the scheduling system. The bicriteria scheduling models related to the maximum tardiness and the weighted number of tardy jobs have been studied in the literature. In this paper we consider a new model with criteria of the due date assignment cost and the total weighted tardiness. The main results are polynomial-time algorithms for the linear combination version, the constraint version, and the Pareto optimization version of bicriteria scheduling.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.