Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops

DOI10.1016/0305-0548(95)00083-6zbMath0868.90064OpenAlexW2037467932MaRDI QIDQ2563865

Bajis Dodin

Publication date: 6 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00083-6

zbMATH Keywords

minimum makespanstochastic flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Related Items (6)

Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability ⋮ A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation ⋮ Johnson's problem with stochastic processing times and optimal service level

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of the static, stochastic job sequencing literature
• Optimal two- and three-stage production schedules with setup times included
• The interchangeability of ·/M/1 queues in series
• Inequalities and Bounds in Stochastic Shop Scheduling
• Bounding the Project Completion Time Distribution in PERT Networks
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• A Review of Production Scheduling
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size
• Association of Random Variables, with Applications
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

This page was built for publication: Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops