Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness, and tardiness penalties

Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness, and tardiness penalties

0.00 Avg rating0 Votes
Article ID: iaor1994598
Country: United Kingdom
Volume: 31
Issue: 7
Start Page Number: 1611
End Page Number: 1620
Publication Date: Jul 1993
Journal: International Journal of Production Research
Authors: , ,
Abstract:

Costs of flowtime, earliness and tardiness should be incorporated in real production scheduling. This paper constructs a single-machine scheduling model with a common due date to minimize the total cost including an identical, asymmetric earliness-tardiness cost. Several dominance conditions necessary for an optimal schedule are derived. A branch and bound algorithm exploiting the conditions is proposed to find an optimal schedule for an unconstrained version of the scheduling problem. Numerical experiments are demonstrated to show the effectiveness of the proposed method.

Reviews

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