An improved earliness-tardiness timing algorithm

Authors:
Yann Hendel;Francis Sourd
Affiliations:
LIP6, UMR7606, 8, rue du Capitaine Scott, 75015 Paris, France;LIP6, UMR7606, 8, rue du Capitaine Scott, 75015 Paris, France
Venue:
Computers and Operations Research
Year:
2007

Citing 7
Cited 9

Data structures and network algorithms

Data structures and network algorithms
One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Isotonic median regression: a linear programming approach

Mathematics of Operations Research
PERT scheduling with convex cost functions

Theoretical Computer Science
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints

Operations Research
An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions

Computers and Operations Research
Minimizing the earliness-tardiness costs on a single machine

Computers and Operations Research

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Computers and Operations Research
Hybrid approach using ant colony optimization and fuzzy logic to solve multi-criteria hybrid flow shop scheduling problem

CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
A new model for the preemptive earliness-tardiness scheduling problem

Computers and Operations Research
Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Computers and Operations Research
A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop

Engineering Applications of Artificial Intelligence
The one-machine just-in-time scheduling problem with preemption

Discrete Optimization
Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem

Computers and Industrial Engineering
Resource constrained project scheduling problem with discounted earliness-tardiness penalties: Mathematical modeling and solving procedure

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.01

Visualization

Abstract

Earliness-tardiness criteria with distinct due dates usually induce NP-complete problems. Researchers have focused on particular cases like the timing problem, which is to look for the optimal schedule when the jobs sequence is already known. These timing algorithms are very useful since they can be used in more complex procedures. In the first part of this paper we provide the most efficient and fairly general algorithm to solve the one-machine timing problem. It is then adapted to a permutation flow shop problem.