A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times

Computers and Chemical Engineering

Volumn 26, Issue 1, 2002, Pages 41-57

  Balasubramanian, J ^a   Grossmann, I E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Branch and bound algorithm; Flowshop; Mixed integer linear program (MILP); Scheduling; Uncertainty

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PLANTS (BOTANY);

PROCESSING TIME;

CHEMICAL ENGINEERING;

ALGORITHM; PROCESS PLANT; SCHEDULING;

ALGORITHM; ARTICLE; CHEMICAL ENGINEERING; STATISTICAL ANALYSIS; STATISTICS; UNITED STATES;

EID: 0037081993     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(01)00735-9     Document Type: Article

References (38)

1. Scheduling to minimize the expected completion time in flowshops with uncertain processing times
2. Using detailed scheduling to obtain realistic operating policies for a batch processing facility
3. Efficient optimization algorithms for zero-wait scheduling of multiproduct batch plants
4. A disaggregation algorithm for the optimization of stochastic planning models
5. Expectation-variance analysis of job sequences under processing time uncertainty
6. On the expected duration of PERT type networks
7. Expected critical path lengths in PERT networks
8. The complexity of flowshop and job shop scheduling
9. Coverting the 0-1 polynomial programming problem to a linear 0-1 program
10. Computational complexity of PERT problems
11. A Bayesian sequential single machine scheduling problem to minimize the expected weighted sum of flowtimes of jobs with exponential processing times
12. A framework for schedule evaluation with processing uncertainty
13. Batch plant design and operations under uncertainty
14. Optimal two-and three-stage production schedules with setup times included
15. Stochastically minimizing the makespan in two-machine flowshops without blocking
16. On three-machine flow shops with random job processing times
17. Discrete approximations to continuous univariate distributions - An alternative to simulation
18. A branch and bound procedure for the design of mulitpurpose batch plants with uncertain demands
19. Counterexamples to optimal permutation schedules for certain flowshops problems
20. Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods
21. Multiperiod planning and scheduling of multiproduct batch plants under demand uncertainty
22. The "Largest Variance first" policy in some stochastic scheduling problems
23. Assignment and sequencing models for the scheduling of process systems
24. Completion times in serial mixed-storage mulitproduct processes with transfer and set-up times
25. Perspectives on scheduling and planning of process operations
26. Approximation of an ideal online scheduler for a multiproduct batch plant
27. Optimization models for the scheduling of testing tasks in new product development
28. The exact overall time distribution of a project with uncertain task durations
29. Single and multisite planning and scheduling: Current status and future challenges
30. Design of batch chemical plants under market uncertainty
31. Stochastic programming with fixed recourse: The equivalent deterministic program