Parallel machine earliness and tardiness scheduling with proportional weights

Parallel machine earliness and tardiness scheduling with proportional weights

0.00 Avg rating—0 Votes
Article ID: iaor20033132
Country: United Kingdom
Volume: 30
Issue: 5
Start Page Number: 801
End Page Number: 808
Publication Date: Apr 2003
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: dynamic, heuristics
Abstract:

In this paper we study the problem of scheduling n jobs with a common due date and proportional early and tardy penalties on m identical parallel machines. We show that the problem is NP-hard and propose a dynamic programming algorithm to solve it. We also propose two heuristics to tackle the problem and analyze their worst-case error bounds.

Reviews

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