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

DOI10.1287/OPRE.27.4.782MaRDI QIDQ3863680zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(14)

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Scheduling Opposing Forests
• The most likely path on series-parallel networks
• Job lateness in a two-machine flowshop with setup times separated
• Sequencing with general precedence constraints
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Non-bottleneck machines in three-machine flow shops
• A decomposition theory based on a dominance relation and composite jobs
• Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• The two-machine flow shop problem with arbitrary precedence relations
• A compact labelling scheme for series-parallel graphs

This page was built for publication: The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863680)