Scheduling in stochastic flowshops with independent setup, processing and removal times

Scheduling in stochastic flowshops with independent setup, processing and removal times

0.00 Avg rating0 Votes
Article ID: iaor19981658
Country: United Kingdom
Volume: 24
Issue: 10
Start Page Number: 955
End Page Number: 960
Publication Date: Oct 1997
Journal: Computers and Operations Research
Authors:
Abstract:

The two-machine flowshop problem, where setup and removal times are independent from processing times and machines suffer stochastic breakdowns, is considered with respect to makespan performance measure. After the problem is formulated, an objective function for the makespan is developed. Under certain conditions on the breakdown processes, it is shown that Sule and Huang's algorithm for the deterministic problem stochastically minimizes makespan for the stochastic counterpart problem.

Reviews

Required fields are marked *. Your email address will not be published.