Abstract
In many real-life scheduling situations, the jobs deteriorate at a certain rate while waiting to be processed. This study introduces a new deterioration model where the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position. The objective is to find the optimal schedule such that the makespan or total completion time is minimised. This study first shows that both problems are solvable in O(n log n) time. This study further shows that in both cases there exists an optimal schedule that is the shortest processing time, longest processing time, or V-shaped with respect to the job normal processing times, depending on the relationships between problem parameters.
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 callMore From: International Journal of Computer Integrated Manufacturing
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.
