The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
From MaRDI portal
Publication:3853421
DOI10.1287/OPRE.27.4.792zbMath0419.90046OpenAlexW2017551122MaRDI QIDQ3853421
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.4.792
computational complexityschedulingsequencingpolynomial algorithmseries-parallel precedence constraintstwo-machine maximum flow time problem
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (12)
A compact labelling scheme for series-parallel graphs ⋮ The two-machine flow shop problem with arbitrary precedence relations ⋮ The three-machine flow-shop problem with arbitrary precedence relations ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Open shop problems with unit time operations ⋮ Sequencing with general precedence constraints ⋮ Minimizing the makespan in a two-machine cross-docking flow shop problem ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times ⋮ A decomposition theory based on a dominance relation and composite jobs ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Effective optimization methods for single-machine scheduling (survey) ⋮ Algorithms for two-machine flow-shop sequencing with precedence constraints
This page was built for publication: The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
