Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints

DOI10.1016/j.cor.2010.07.007zbMath1251.90161arXiv1509.02099OpenAlexW2141506759MaRDI QIDQ1762106

Jacques Lamothe, Paul Gaborit, Matthieu Dupuy, Francois Marmier, Lionel Dupont

Publication date: 15 November 2012

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

Full work available at URL: https://arxiv.org/abs/1509.02099

zbMATH Keywords

heuristicsschedulingsimulated annealingparallel machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

A hybrid differential evolution approach based on surrogate modelling for scheduling bottleneck stages ⋮ Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports ⋮ A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem ⋮ A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ The significance of reducing setup times/setup costs ⋮ A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
• A scheduling problem with unrelated parallel machines and sequence dependent setups
• Scheduling jobs on parallel machines with sequence-dependent setup times
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Scheduling with batching: A review
• Simulated annealing heuristic for flow shop scheduling problems with 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
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions
• The Total Tardiness Problem: Review and Extensions
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• Dynamic programming algorithms for scheduling parallel machines with family setup times
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• An agent-based approach for scheduling multiple machines

This page was built for publication: Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints