Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates

DOI<913::AID-NAV3220410705>3.0.CO;2-A 10.1002/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-AzbMath0815.90093OpenAlexW2067436380MaRDI QIDQ4319220

Yeong-Dae Kim, Candace Arai Yano

Publication date: 27 June 1995

Full work available at URL: https://doi.org/10.1002/1520-6750(199412)41:7<913::aid-nav3220410705>3.0.co;2-a

zbMATH Keywords

single-machine schedulingdue datesmean tardiness and earlinessoptimal and heuristic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Preemption in single machine earliness/tardiness scheduling ⋮ A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling ⋮ A comparison of lower bounds for the single-machine early/tardy problem ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem ⋮ A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time ⋮ AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES ⋮ A branch and bound approach for single machine scheduling with earliness and tardiness penalties ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ Single machine scheduling with family setups to minimize total earliness and tardiness ⋮ Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed ⋮ Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert ⋮ Multiple machine JIT scheduling: a tabu search approach ⋮ Earliness-tardiness scheduling with setup considerations ⋮ Parallel machine scheduling with a common due window ⋮ A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS ⋮ BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS ⋮ A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems ⋮ Multicriteria scheduling ⋮ Punctuality and idleness in just-in-time scheduling ⋮ Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert ⋮ A heuristic for single machine scheduling with early and tardy costs ⋮ Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs ⋮ A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem ⋮ Minimizing earliness and tardiness costs in stochastic scheduling