On three-machine flow shops with random job processing times

DOI10.1016/S0377-2217(99)00222-2MaRDI QIDQ1580990zbMATH OpenFDO

Authors Jerzy Kamburowski

Publication date 14 September 2000

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

Full work available at URL https://doi.org/10.1016/S0377-2217(99)00222-2

zbMATH Keywords

flow shopmakespanstochastic order relationstochastic scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
• Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Stochastic flowshop no-wait scheduling

Cites work

• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Counterexamples to optimal permutation schedules for certain flow shop problems
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 605729 (Why is no real title available?)
• Mathematical aspects of the 3 × n job-shop sequencing problem
• Minimizing the Expected Makespan in Stochastic Flow Shops
• nx2 flowshop sequencing problem with random processing times
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Optimal two- and three-stage production schedules with set-up time included
• Rearrangement, Majorization and Stochastic Scheduling
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
• The Complexity of Flowshop and Jobshop Scheduling
• Three-machine flowshop stochastic scheduling to minimize distribution of schedule length

Cited in

(16)

• A contribution to the stochastic flow shop scheduling problem.
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity
• scientific article; zbMATH DE number 5856053 (Why is no real title available?)
• Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
• scientific article; zbMATH DE number 3843477 (Why is no real title available?)
• Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
• 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
• Inequalities for stochastic flow shops and job shops
• Technical note Stochastic flowshop makespan simplifications
• A generalized Johnson's rule for stochastic assembly systems
• Flowshop scheduling problem to minimize total completion time with random and bounded processing times
• Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs

This page was built for publication: On three-machine flow shops with random job processing times

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