Due-date assignment and parallel-machine scheduling with deteriorating jobs

Due-date assignment and parallel-machine scheduling with deteriorating jobs

0.00 Avg rating0 Votes
Article ID: iaor20082429
Country: United Kingdom
Volume: 58
Issue: 8
Start Page Number: 1103
End Page Number: 1108
Publication Date: Aug 2007
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: deteriorating items
Abstract:

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuristic algorithm to find near-optimal solutions for the problem. When the due-date penalty is 0, we present a polynomial time algorithm to solve it.

Reviews

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