Lower bounds for scheduling on identical parallel machines with heads and tails

DOI10.1023/B:ANOR.0000030688.31785.40zbMath1056.90065OpenAlexW1981795232MaRDI QIDQ596460

Mohamed Haouari, Anis Gharbi

Publication date: 10 August 2004

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000030688.31785.40

zbMATH Keywords

schedulingmakespanlower boundrelease datesidentical parallel machinesdelivery times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Energetic reasoning revisited: Application to parallel machine scheduling ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ Maximizing the minimum completion time on parallel machines ⋮ Tight bounds for the identical parallel machine scheduling problem ⋮ Fast lifting procedures for the bin packing problem ⋮ Online Scheduling on Two Parallel Machines with Release Times and Delivery Times ⋮ Online scheduling on two parallel machines with release dates and delivery times