Abstract
Scheduling deteriorating jobs on parallel machines is an NP-hard problem, for which heuristics would be the first solution option. Two variants of linearly deteriorating jobs are considered. The first is that with simple linear deterioration, i.e. where there is a deterioration rate only, which is meaningful only if the jobs are assumed to be available at a positive time t0. In the second variant, there is a basic processing time and a deterioration rate and all jobs are available at time t = 0. In both cases, we seek to minimize the makespan. Starting from simple heuristics, both steepest descent search and simulated annealing are designed and implemented to arrive at optimal or near-optimal solutions. Computational results for randomly generated problem instances with different job/machine combinations are presented.
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.
