Optimal parallel machines scheduling with availability constraints

DOI10.1016/j.dam.2004.12.003zbMath1066.90028OpenAlexW2068647239MaRDI QIDQ1775061

Anis Gharbi, Mohamed Haouari

Publication date: 4 May 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.12.003

zbMATH Keywords

Branch-and-boundRelease dateParallel machinesDelivery timeMachine availability

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints ⋮ Energetic reasoning revisited: Application to parallel machine scheduling ⋮ Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ Fault tolerant scheduling of tasks of two sizes under resource augmentation ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints ⋮ Bounding strategies for the hybrid flow shop scheduling problem ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ Single machine scheduling with forbidden start times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• A general lower bound for the makespan problem
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Minimizing makespan on parallel machines subject to release dates and delivery times
• An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
• Tight LP bounds for resource constrained project scheduling
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• A note on parallel machine scheduling with non-simultaneous machine available time
• Scheduling with limited machine availability
• Une méthode arborescente pour résoudre les problèmes cumulatifs
• Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• An Exact Method for Solving the Multi-Processor Flow-Shop
• An exact algorithm for the subset sum problem

This page was built for publication: Optimal parallel machines scheduling with availability constraints