Scheduling on parallel identical machines to minimize total tardiness

DOI10.1016/j.ejor.2005.09.038zbMath1111.90046OpenAlexW2055405237MaRDI QIDQ856206

Yeong-Dae Kim, Sang-Oh Shim

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.038

zbMATH Keywords

schedulingbranch and bound algorithmidentical parallel machinestotal tardiness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (23)

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions ⋮ Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ Acquisition planning and scheduling of computing resources ⋮ Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ A united search particle swarm optimization algorithm for multiobjective scheduling problem ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Dynamic scheduling of patients in emergency departments ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility ⋮ Two branch-and-bound algorithms for the robust parallel machine scheduling problem ⋮ Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness ⋮ A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem ⋮ Heuristic algorithms for a complex parallel machine scheduling problem ⋮ Scheduling with uncertain processing times in mixed-criticality systems ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Order assignment and scheduling under processing and distribution time uncertainty ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

Cites Work

• Minimizing total tardiness in permutation flowshops
• Scheduling jobs on parallel machines with sequence-dependent setup times
• A heuristic for the single machine tardiness problem
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• A tabu search algorithm for parallel machine total tardiness problem
• Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Technical Note—A Note on the Weighted Tardiness Problem
• Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
• Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
• The Total Tardiness Problem: Review and Extensions
• Heuristics for minimizing mean tardiness form parallel machines
• Scheduling with Deadlines and Loss Functions on k Parallel Machines
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling on parallel identical machines to minimize total tardiness