Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
DOI10.1080/01966324.1988.10737234zbMATH Open0714.90053OpenAlexW1972359790WikidataQ58249513 ScholiaQ58249513MaRDI QIDQ3200873FDOQ3200873
Authors: Frank G. Forst 
Publication date: 1988
Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01966324.1988.10737234
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
flow shopstochastic schedulingrandom processing timesexponential job processing timespenalty cost functiontwo-machines
Cites Work
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
- Scheduling with Random Service Times
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Inequalities for stochastic flow shops and job shops
- Minimizing total expected costs in the two-machine, stochastic flow shop
- The Minimum Spanning Tree Problem with Time Window Constraints
Cited In (4)
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)
