An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

DOI10.1016/S0167-6377(02)00177-3zbMath1013.90066MaRDI QIDQ1870003

Anis Gharbi, Mohamed Haouari

Publication date: 4 May 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

lower boundrelease datesdue datesidentical parallel machinesmaximum latenesspreemption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Energetic reasoning revisited: Application to parallel machine scheduling ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem ⋮ Search tree based approaches for parallel machine scheduling ⋮ Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• 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
• Some simple scheduling algorithms

This page was built for publication: An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines