Stochastically minimizing the makespan in two-machine flow shops without blocking

DOI10.1016/S0377-2217(97)00424-4zbMath0938.90029MaRDI QIDQ1806913

Jerzy Kamburowski

Publication date: 29 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

makespanflow shopstochastic orderingstochastic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ Two-machine flowshop minimum-length scheduling problem with random and bounded processing times ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ A contribution to the stochastic flow shop scheduling problem. ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering ⋮ On three-machine flow shops with random job processing times ⋮ 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

• Optimal two- and three-stage production schedules with setup times included
• Rearrangement, Majorization and Stochastic Scheduling
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• The Reversibility Property of Production Lines
• Minimizing the Expected Makespan in Stochastic Flow Shops
• The Complexity of Flowshop and Jobshop Scheduling
• The stochastic flowshop makespan. Part II. Some general results for the unbuffered case
• A generalized bivariate exponential distribution
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
• Unnamed Item
• Unnamed Item

This page was built for publication: Stochastically minimizing the makespan in two-machine flow shops without blocking