The Constrained Minimum Weighted Sum of Job Completion Times Problem

Asaf Levin,Gerhard J Woeginger

doi:10.1007/978-3-540-25960-2_23

The Constrained Minimum Weighted Sum of Job Completion Times Problem

Asaf Levin, Gerhard J Woeginger

Open Access

https://doi.org/10.1007/978-3-540-25960-2_23

Copy DOI

Publication Date: Jan 1, 2004

Citations: 8

Affiliation: Technion – Israel Institute of Technology, Eindhoven University of Technology, University of Twente

#Sum Of Job Completion Times #Single Machine + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weighted sum of job completion times (with respect to different job weights). This problem is NP-hard, and we provide a polynomial time approximation scheme for this problem. Our method is based on Lagrangian relaxation mixed with carefully guessing the positions of certain jobs in the schedule.Keywordsschedulingbicriteria optimizationapproximation scheme

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

Similar Papers

Paper Title

Journal

Date

Author

View more papers

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.