Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
From MaRDI portal
Publication:2890475
DOI10.1287/ijoc.1040.0082zbMath1239.68018OpenAlexW2138950807MaRDI QIDQ2890475
Hoogeveen, J. A., Ann Vandevelde, Cor A. J. Hurkens, Jan Karel Lenstra
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1040.0082
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Energetic reasoning revisited: Application to parallel machine scheduling, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Search tree based approaches for parallel machine scheduling, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, Bounding strategies for the hybrid flow shop scheduling problem, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, The hybrid flow shop scheduling problem, Preemptive hybrid flowshop scheduling problem of interval orders
