A Probabilistic Analysis of Two-Machine Flowshops

DOI10.1287/opre.44.6.899zbMath0879.90117OpenAlexW2078103562MaRDI QIDQ4346342

Gideon Weiss, John J. III Bartholdi, James M. Calvin, John H. Vande Vate, Amar Ramudhin

Publication date: 3 August 1997

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

Full work available at URL: https://doi.org/10.1287/opre.44.6.899

zbMATH Keywords

probabilistic analysismakespantwo-machine flowshoprandom schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Effective on-line algorithms for reliable due date quotation and large-scale scheduling ⋮ Scheduling and due‐date quotation in a make‐to‐order supply chain ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ An empirical analysis of the optimality rate of flow shop heuristics

This page was built for publication: A Probabilistic Analysis of Two-Machine Flowshops