Algorithm for minimizing weighted earliness penalty in single-machine problem

DOI10.1016/j.ejor.2003.07.017zbMath1071.90020OpenAlexW2166180443MaRDI QIDQ706977

Pius J. Egbelu, Supachai Pathumnakul

Publication date: 9 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.07.017

zbMATH Keywords

SchedulingDeadlineEarlinessHeuristicTardiness

Mathematics Subject Classification ID

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

Related Items (5)

Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties ⋮ Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain

Cites Work

• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• A fixed interval due-date scheduling problem with earliness and due-date costs
• Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
• Sequencing with Earliness and Tardiness Penalties: A Review
• The Single Machine Early/Tardy Problem

This page was built for publication: Algorithm for minimizing weighted earliness penalty in single-machine problem