Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem

DOI10.1002/(SICI)1520-6750(199702)44:1%3C109::AID-NAV7%3E3.0.CO;2-EzbMATH Open0882.90068OpenAlexW2068569445MaRDI QIDQ4346870FDOQ4346870

Authors: C. Koulamas 

Publication date: 5 August 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1%3C109::aid-nav7%3E3.0.co;2-e

Recommendations

• scientific article; zbMATH DE number 906534
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
• A tabu search algorithm for parallel machine total tardiness problem
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• Heuristics for minimizing mean tardiness form parallel machines
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
• Simulated annealing algorithm for solving the single machine early/tardy problem

zbMATH Keywords

parallel-machine tardiness problempolynomial decomposition heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (20)

• A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
• ILP models and column generation for the minimum sum coloring problem
• Parallel machine scheduling considering a job-splitting property
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• Scheduling on parallel identical machines to minimize total tardiness
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
• Minimizing the average tardiness: the case of outsource machines
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
• Performance-extending approaches for total tardiness scheduling problem on one machine
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• A tabu search algorithm for parallel machine total tardiness problem
• On decomposition of the total tardiness problem
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

This page was built for publication: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346870)