A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
Comments on ``A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
Mathematical programming formulations for machine scheduling: A survey
Scheduling on parallel identical machines to minimize total tardiness
Scheduling unrelated parallel machines with sequence-dependent setups
A state-of-the-art review of parallel-machine scheduling research
Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
Scheduling jobs on parallel machines with sequence-dependent setup times
Scheduling unrelated parallel machines to minimize total weighted tardiness.
An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
A decomposition algorithm for the single machine total tardiness problem
Heuristics for scheduling unrelated parallel machines
A survey of scheduling problems with setup times or costs
Minimizing Total Tardiness on One Machine is NP-Hard
Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
Scheduling independent tasks to reduce mean finishing time
Heuristics for minimizing mean tardiness form parallel machines
Minimizing total tardiness in an unrelated parallel-machine scheduling problem

This page was built for publication: A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization