An approximate decomposition algorithm for scheduling on parallel machines with heads and tails

DOI10.1016/j.cor.2005.05.012zbMath1120.90018MaRDI QIDQ2433392

Mohamed Haouari, Anis Gharbi

Publication date: 27 October 2006

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

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

zbMATH Keywords

scheduling; heuristic; release dates; identical parallel machines; delivery times

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

An optimization-based heuristic for the machine reassignment problem, Bounding strategies for the hybrid flow shop scheduling problem, A simulated annealing approach to minimize the maximum lateness on uniform parallel machines, Energetic reasoning revisited: Application to parallel machine scheduling, Search tree based approaches for parallel machine scheduling, A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan, Online scheduling on two parallel machines with release dates and delivery times, A prediction based iterative decomposition algorithm for scheduling large-scale job shops, Online Scheduling on Two Parallel Machines with Release Times and Delivery Times

Cites Work

• Unnamed Item
• Lower bounds for scheduling on identical parallel machines with heads and tails
• A block approach for single-machine scheduling with release dates and due dates
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• The one-machine sequencing problem
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• Minimizing makespan on parallel machines subject to release dates and delivery times
• Optimal parallel machines scheduling with availability constraints
• An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
• Bounds for naive multiple machine scheduling with release times and deadlines
• Une méthode arborescente pour résoudre les problèmes cumulatifs
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Some simple scheduling algorithms
• An Exact Method for Solving the Multi-Processor Flow-Shop
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs