A heuristic for single machine scheduling with early and tardy costs

DOI10.1016/S0377-2217(99)00345-8zbMath0983.90021MaRDI QIDQ1592742

Renata Mazzini, Vinicius Amaral Armentano

Publication date: 25 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsschedulingearlinesssingle machinetardiness

Mathematics Subject Classification ID

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

Related Items

Preemption in single machine earliness/tardiness scheduling ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Minmax scheduling with job-classes and earliness-tardiness costs ⋮ Multi-agent-based workload control for make-to-order manufacturing ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ A recovering beam search algorithm for the single machine just-in-time scheduling problem ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Counting and enumeration complexity with application to multicriteria scheduling

Cites Work

• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A decomposition algorithm for the single machine total tardiness problem
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Sequencing with Earliness and Tardiness Penalties: A Review
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Single-machine scheduling with early and tardy completion costs