Improved heuristics for the early/tardy scheduling problem with no idle time

DOI10.1016/j.cor.2003.08.003zbMath1061.90050OpenAlexW2011941357MaRDI QIDQ1886859

Jorge M. S. Valente, Rui A. F. S. Alves

Publication date: 19 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/2906

zbMATH Keywords

HeuristicsSchedulingEarly/tardyDispatch rulesDominance rules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ EA/G-GA for single machine scheduling problems with earliness/tardiness costs ⋮ An exact approach to early/tardy scheduling with release dates ⋮ A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM

Cites Work

• Unnamed Item
• Single machine earliness and tardiness scheduling
• Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• A greedy heuristic for the mean tardiness sequencing problem
• Sequencing with Earliness and Tardiness Penalties: A Review
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem

This page was built for publication: Improved heuristics for the early/tardy scheduling problem with no idle time