Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications
Christodoulos A. Floudas, Xiaoxia Lin · Annals of Operations Research · 2005
Cited by 422 works. doi:10.1007/s10479-005-3446-x
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- A general algorithm for short-term scheduling of batch operations—I. MILP formulation
- On the Job-Shop Scheduling Problem
- The Schedule-Sequencing Problem
- Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- A general algorithm for short-term scheduling of batch operations—II. Computational issues
- The optimal operation of mixed production facilities—a general formulation and some approaches for the solution
- Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes
- A Continuous Time Mixed Integer Linear Programming Model for Short Term Scheduling of Multistage Batch Plants