Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
From MaRDI portal
Publication:4346870
DOI<109::AID-NAV7>3.0.CO;2-E 10.1002/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-EzbMath0882.90068OpenAlexW2068569445MaRDI QIDQ4346870
Publication date: 5 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1<109::aid-nav7>3.0.co;2-e
Related Items (17)
Scheduling on parallel identical machines to minimize total tardiness ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports ⋮ Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach ⋮ Minimizing the average tardiness: the case of outsource machines ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Scheduling unrelated parallel machines to minimize total weighted tardiness. ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ ILP models and column generation for the minimum sum coloring problem ⋮ Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem ⋮ Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints ⋮ A tabu search algorithm for parallel machine total tardiness problem ⋮ Parallel machine scheduling considering a job-splitting property ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
This page was built for publication: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
