Abstract
We consider a project scheduling problem in which the jobs can be compressed by using additional resources to meet the corresponding due dates. The project consists of multiple independent subprojects with completely ordered jobs. Some jobs have their own due dates for interim assessments of whole project. A penalty cost arises from the tardiness of a job, but it can be avoided through the compression of some jobs, which requires an additional cost. The objective is to minimize the total tardiness penalty and compression costs. We investigate optimality properties and develop an algorithm to find an optimal schedule in strongly polynomial time.
Sign-in/Register to access full text options 
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.
