The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations

DOI10.1287/OPRE.27.4.782zbMath0426.90047OpenAlexW2073284889MaRDI QIDQ3863680

Jeffrey B. Sidney

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.782

zbMATH Keywords

minimization of makespantwo-machine maximum flow time problempolynomial bounded optimal algorithmseries parallel precedence relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (14)

A compact labelling scheme for series-parallel graphs ⋮ The two-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 ⋮ Sequencing with general precedence constraints ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ 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 ⋮ The most likely path on series-parallel networks ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Scheduling Opposing Forests ⋮ Non-bottleneck machines in three-machine flow shops ⋮ 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 Relations