Single machine earliness-tardiness scheduling problems using the Equal-Slack rule

Single machine earliness-tardiness scheduling problems using the Equal-Slack rule

0.00 Avg rating0 Votes
Article ID: iaor1995536
Country: United Kingdom
Volume: 45
Issue: 5
Start Page Number: 589
End Page Number: 594
Publication Date: May 1994
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

The purpose of this paper is to analyse a special case of the non-pre-emptive single machine scheduling problem where the distinct due dates for each job are related to processing times according to the Equal-Slack rule. The scheduling objective is to minimize the sum of earliness and tardiness penalties. After determining some properties of the problem, the unrestricted case is shown to be equivalent to a polynomial time solvable problem, wheras the restricted case is shown to be NP-hard, and suggestions are made for further research.

Reviews

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