MILP model for scheduling and design of a special class of multipurpose batch plants
- 31 December 1996
- journal article
- Published by Elsevier BV in Computers & Chemical Engineering
- Vol. 20 (11), 1335-1360
- https://doi.org/10.1016/0098-1354(96)81812-6
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A general algorithm for short-term scheduling of batch operations—I. MILP formulationComputers & Chemical Engineering, 1993
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Optimal design of multipurpose batch plants. 1. Problem formulationIndustrial & Engineering Chemistry Research, 1990
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- Completion time algorithms for serial multiproduct batch processes with shared storageComputers & Chemical Engineering, 1990
- Efficient optimization algorithms for zero-wait scheduling of multiproduct batch plantsIndustrial & Engineering Chemistry Research, 1989
- Design of multiproduct batch processes with finite intermediate storageComputers & Chemical Engineering, 1989
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985
- On the facial structure of scheduling polyhedraPublished by Springer Science and Business Media LLC ,1985
- Intermediate storage in noncontinuous processes involving stages of parallel unitsAIChE Journal, 1985