Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Authors:
V. Lauff;F. Werner
Affiliations:
-;-
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2004

Citing 8
Cited 11

Sequencing with earliness and tardiness penalties: a review

Operations Research
Heuristics for multimachine scheduling problems with earliness and tardiness costs

Management Science
Parallel machine earliness and tardiness scheduling with proportional weights

Computers and Operations Research
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties

Computers and Operations Research
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

Mathematical and Computer Modelling: An International Journal
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date

Operations Research Letters
The complexity of scheduling job families about a common due date

Operations Research Letters
Equivalence of mean flow time problems and mean absolute deviation problems

Operations Research Letters

Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: a case study based on the apparel industry

Computers and Industrial Engineering
Exponential neighborhood search for a parallel machine scheduling problem

Computers and Operations Research
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of Scheduling
A genetic algorithm for JIT single machine scheduling with preemption and machine idle time

Expert Systems with Applications: An International Journal
Two due date assignment problems with position-dependent processing time on a single-machine

Computers and Industrial Engineering
Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

Computers and Operations Research
Scheduling job classes on uniform machines

Computers and Operations Research
Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Computers and Industrial Engineering
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal
Single-machine batch delivery scheduling with an assignable common due date and controllable processing times

Computers and Industrial Engineering
A multi-agent system for the weighted earliness tardiness parallel machine problem

Computers and Operations Research

Quantified Score

Hi-index	0.98

Visualization

Abstract

The just-in-time production philosophy has led to a growing interest in schedulingproblems considering both earliness and tardiness penalties. Most publications considering these so-called nonregular objective functions are devoted to single machine problems. In the case of multimachine problems, there are some papers dealing with parallel machine problems. However, for multi-operation scheduling problems such as shop scheduling problems, investigations have begun only recently. In this paper, inspired by recent own work (partly yet unpublished), we survey some results on multimachine scheduling problems with a given common due date, where the focus is on possible approaches for shop scheduling problems.