Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
From MaRDI portal
Recommendations
- Stochastically minimizing total penalty costs in stochastic flow shops
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- On three-machine flow shops with random job processing times
- Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop
Cites work
- Inequalities for stochastic flow shops and job shops
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Minimizing total expected costs in the two-machine, stochastic flow shop
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
- Scheduling with Random Service Times
- The Minimum Spanning Tree Problem with Time Window Constraints
Cited in
(4)- Stochastically minimizing total penalty costs in stochastic flow shops
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Average cost optimality for an unreliable two-machine flowshop with limited internal buffer
- scientific article; zbMATH DE number 4074798 (Why is no real title available?)
This page was built for publication: Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200873)
