Abstract

This paper considers scheduling linear deteriorating jobs on a single machine. The jobs are processed in batches and the objective is to minimize the makespan. Linear deterioration effect means that job's actual processing time is a linear increasing function on its waiting time, i.e., the time between the execution of the batch to which the job belongs and the job's starting time. We propose a fully polynomial-time approximation scheme (FPTAS) to show the problem is NP-hard in the ordinary sense.

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.