An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns

European Journal of Operational Research

Volumn 140, Issue 2, 2002, Pages 384-398

  Alcaide, D ^a   Rodriguez Gonzalez, A ^a   Sicilia, J ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Expected makespan; Flow shops; Scheduling; Stochastic scheduling

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; RANDOM PROCESSES; SCHEDULING;

FLOW-SHOP PROBLEMS;

OPERATIONS RESEARCH;

EID: 0037118759     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00077-2     Document Type: Conference Paper

References (18)

1. Machine scheduling
2. N-job, 2 machine sequencing problem with stochastic service times
3. Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
4. Optimal two and three stage production schedules with setup includes
5. Sequencing and scheduling: Algorithms and complexity
6. Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
7. A note on the two-machine job shop with exponential processing time
8. A note on stochastic scheduling on a single machine subject to breakdowns and repair
9. Minimizing expected makespan in stochastic open shops
10. Stochastic shop scheduling: A survey
11. Inequalities for stochastic flow shops and job shops
12. Multiserver stochastic scheduling
13. A tutorial in stochastic scheduling