Heuristics for minimizing mean tardiness form parallel machines

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I" /><367::AID-NAV3220380307>3.0.CO;2-I 10.1002/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-IzbMath0725.90043OpenAlexW1964181737MaRDI QIDQ5202825

Yih-Long Chang, Johnny C. Ho

Publication date: 1991

Full work available at URL: https://doi.org/10.1002/1520-6750(199106)38:3<367::aid-nav3220380307>3.0.co;2-i

zbMATH Keywords

simulationparallel machinesheuristicjob tardinesssingle-machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item

Related Items (11)

Scheduling on parallel identical machines to minimize total tardiness ⋮ Acquisition planning and scheduling of computing resources ⋮ Scheduling parallel machines to minimize total weighted and unweighted tardiness ⋮ Minimizing the number of tardy jobs for \(m\) parallel machines ⋮ Scheduling unrelated parallel machines with sequence-dependent setups ⋮ Minimizing the average tardiness: the case of outsource machines ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ A tabu search algorithm for parallel machine total tardiness problem ⋮ Parallel machine scheduling considering a job-splitting property ⋮ A note on the equivalence of two heuristics to minimize total tardiness

This page was built for publication: Heuristics for minimizing mean tardiness form parallel machines