Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect

Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect

0.00 Avg rating0 Votes
Article ID: iaor20091001
Country: United Kingdom
Volume: 59
Issue: 3
Start Page Number: 416
End Page Number: 420
Publication Date: Mar 2008
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

In this paper, we study a single-machine scheduling problem with the cyclic process of an aging effect. This phenomenon appears in many realistic production processes. Thus, it is important to consider the phenomenon in scheduling problems. We analyse the single-machine makespan scheduling problem with two different aging effect models and provide a polynomial time algorithm to solve the problem.

Reviews

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