Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance

Authors:
Rachid Benmansour;Hamid Allaoui;Abdelhakim Artiba;Saïd Hanafi
Affiliations:
-;-;-;-
Venue:
Computers and Operations Research
Year:
2014

Citing 8
Cited 0

Sequencing with earliness and tardiness penalties: a review

Operations Research
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Computers and Operations Research
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Mixed integer programming formulations for single machine scheduling problems

Computers and Industrial Engineering
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of scheduling a set of jobs on a single machine against a common and restrictive due date. In particular, we are interested in the problem of minimizing the weighted sum of maximum earliness and maximum tardiness costs. This kind of objective function is related to the just-in-time environment where penalties, such as storage cost and additional charges for late delivery, should be avoided. First we present a mixed integer linear model for the problem without availability constraints and we prove that this model can be reduced to a polynomial-time model. Secondly, we suppose that the machine undergoes a periodic preventive maintenance. We present then a second mixed integer linear model to solve the problem to optimality. Although the latter problem can be solved to optimality for small instances, we show that the problem reduces to the one-dimensional bin packing problem. Computational results show that the proposed algorithm best fit decreasing performs well.