Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

DOI10.1016/j.cor.2006.02.009zbMath1127.90020OpenAlexW2010969299MaRDI QIDQ883312

Massimo Paolucci, Davide Anghinolfi

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.009

zbMATH Keywords

metaheuristicsparallel machine schedulingsequence dependent setup timestotal tardiness problem

Mathematics Subject Classification ID

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

Related Items

Distributionally robust single machine scheduling with the total tardiness criterion ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Solving the unconstrained optimization problem by a variable neighborhood search ⋮ Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm ⋮ An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems ⋮ Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem ⋮ Variable neighbourhood search: methods and applications ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ Planning production using mathematical programming: The case of a woodturning company ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ Variable neighbourhood search: Methods and applications ⋮ 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

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Scheduling jobs on parallel machines with sequence-dependent setup times
• Parallel machine scheduling with earliness and tardiness penalties
• A tabu search algorithm for parallel machine total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing maximum lateness on one machine: computational experience and some applications
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
• The Total Tardiness Problem: Review and Extensions
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications
• A memetic algorithm for the total tardiness single machine scheduling problem