Abstract

This paper considers a scheduling model with general learning effects and deteriorating jobs simultaneously, where the actual processing time of a job is a function depends not only on the start time of the job, but also on the total normal processing times of jobs in front of it in the sequence. It shows that the optimal schedule for the single-machine scheduling problem to minimize makespan is obtained by the longest processing time first (LPT) rule. For the problem to minimize total complete time, we use the smallest processing time first (SPT) rule as a heuristic algorithm and analyze its worst-case bound.

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.