Open Access
A General Algorithm for Scheduling Batch Operations
E. Kondili,C.C. Pantelides,Rwh Sargent +2 more
- 01 Jan 1988
- pp 62
84
About: The article was published on 01 Jan 1988. and is currently open access. The article focuses on the topics: Fair-share scheduling & Rate-monotonic scheduling.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications
TL;DR: This paper reviews the advances of mixed-integer linear programming (MILP) based approaches for the scheduling of chemical processing systems and focuses on the short-term scheduling of general network represented processes.
407
Planning and scheduling models for refinery operations
TL;DR: In this paper, a nonlinear planning model for refinery production is presented, which is able to represent a general refinery topology and allows the implementation of nonlinear process models as well as blending relations.
386
Planning and scheduling in the process industry
TL;DR: An overview of the current state-of-the-art of planning and scheduling problems in the chemical process industry and some solution approaches especially those applied to a benchmark problem which has received considerable interest during the last years are presented.
•Posted Content
Quantum Annealing Implementation of Job-Shop Scheduling
TL;DR: A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail and the results from the processor are compared against state-of-the-art global-optimum solvers.
Mixed Integer Programming models for job shop scheduling
Wen-Yang Ku,J. Christopher Beck +1 more
TL;DR: The disjunctive MIP model is most efficient, and MIP is efficient for solving moderate-size problems, while constraint programming is compared to constraint programming and the best known algorithm to provide a broad view among different approaches.
218