Single-machine scheduling with both deterioration and learning effects

Single-machine scheduling with both deterioration and learning effects

0.00 Avg rating0 Votes
Article ID: iaor200973442
Volume: 172
Issue: 1
Start Page Number: 315
End Page Number: 327
Publication Date: Nov 2009
Journal: Annals of Operations Research
Authors: ,
Abstract:

This paper considers a single-machine scheduling problem with both deterioration and learning effects. The objectives are to respectively minimize the makespan, the total completion times, the sum of weighted completion times, the sum of the kth power of the job completion times, the maximum lateness, the total absolute differences in completion times and the sum of earliness, tardiness and common due-date penalties. Several polynomial time algorithms are proposed to optimally solve the problem with the above objectives.

Reviews

Required fields are marked *. Your email address will not be published.