Cyclic scheduling of continuous parallel‐process units with decaying performance
AIChE JournalPublished 1 July 1998
Vipul Jain And, Ignacio E. Grossmann
Citations118
SJR quartileQ1
SJR score0.81
SNIP1.03
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Abstract The problem of scheduling multiple feeds on parallel units is addressed. The performance of each unit is assumed to decrease with time, therefore requiring planned maintenance to restore its performance. A mixed‐integer nonlinear programming (MINLP) model presented uses the process information regarding the exponential decay in performance with time to find a cyclic schedule for feed processing. Optimization trade‐off is between the performance of the units, and the maintenance costs and the loss in production due to shutdowns. Three main decisions for the optimal schedule are: a) assignment of various feeds to different units; b) processing time of each feed on different units; and c) number of subcycles of each feed on diferent units. Special mathematical properties of the MINLP model are exploited to solve the problem to global optimality with a branch‐and‐bound method. Using several examples advantages of the model are illustrated and performances of different solution algorithms are compared.
Keywords
Engineering
Journal of Optimization Theory and ApplicationsGeneralized Benders decomposition
2,420 Citations1972Arthur M. Geoffrion
Mathematical ProgrammingAn outer-approximation algorithm for a class of mixed-integer nonlinear programs
1,436 Citations1986Marco A. Durán, Ignacio E. Grossmann
An outer-approximation algorithm is presented for solving mixed-integer nonlinear programming problems of a particular class and a theoretical comparison with generalized Benders decomposition is presented on the lower bounds predicted by the relaxed master programs.
Computers & Chemical EngineeringA combined penalty function and outer-approximation method for MINLP optimization
749 Citations1990J. Viswanathan, Ignacio E. Grossmann
The results show that although no theoretical guarantee can be given, the proposed method has a high degree of reliability for finding the global optimum in nonconvex problems.
Mathematical ProgrammingSolving mixed integer nonlinear programs by outer approximation
668 Citations1994R. Fletcher, Sven Leyffer
An alternative approach is considered to the difficulties caused by infeasibility in outer approximation, in which exact penalty functions are used to solve the NLP subproblems.
Management ScienceThe Economic Lot Scheduling Problem (ELSP): Review and Extensions
560 Citations1978Salah E. Elmaghraby
Management ScienceBranch and Bound Experiments in Convex Nonlinear Integer Programming
489 Citations1985Omprakash K. Gupta, A. Ravindran
This paper investigates the computational feasibility of branch and bound methods in solving convex nonlinear integer programming problems and develops heuristics to locate an integer feasible solution to provide an upper bound.
Computers & Chemical EngineeringAn LP/NLP based branch and bound algorithm for convex MINLP optimization problems
440 Citations1992Ignacio Quesada, Ignacio E. Grossmann
Preliminary numerical results on several test problems are reported which show that the expense of solving the MI need to be enumerated, while in most cases the number of NLP subproblems to be solved remains the same.
Computers & Chemical EngineeringAn extended cutting plane method for solving convex MINLP problems
369 Citations1995Tapio Westerlund, Frank Pettersson
An extended version of Kelley's cutting plane method is introduced and is suitable for solving large convex MINLP problems with a moderate degree of nonlinearity.
Mathematical ProgrammingA branch-and-cut method for 0-1 mixed convex programming
310 Citations1999Robert A. Stubbs, Sanjay Mehrotra
The disjunctive approach of Balas, Ceria, and Cornuéjols and devevlop a branch-and-cut method for solving 0-1 convex programming problems and shows that cuts can be generated by solving a single convex program.
Computers & Operations ResearchAn improved branch and bound algorithm for mixed integer nonlinear programs
241 Citations1994Brian Borchers, John E. Mitchell
An improved branch and bound code for zero-one mixed integer nonlinear programs with convex objective functions and constraints with Lagrangian duality is described.
Computers & Chemical EngineeringMINLP model for cyclic multiproduct scheduling on continuous parallel lines
158 Citations1991Nikolaos V. Sahinidis, Ignacio E. Grossmann
A computational scheme based on valid outer-approximations of the nonlinear part of the problem is proposed to strengthen the bounds of the master problem and therefore achieve fast convergence.
Computers & Chemical EngineeringOptimal cyclic scheduling of multistage continuous multiproduct plants
156 Citations1994J.M. Pinto, Ignacio E. Grossmann
Computers & Chemical EngineeringAn extended cutting plane method for a class of non-convex MINLP problems
103 Citations1998Tapio Westerlund, Hans Skrifvars +2 more
Global convergence properties of the extended cutting plane method are given for pseudo-convex MINLP problems in the present paper and a numerical example from the paper-converting industry is finally provided to illustrate the numerical procedure.
Annals of Operations ResearchOptimal periodic scheduling of multipurpose batch plants
95 Citations1993Nilay Shah, Constantinos C. Pantelides +1 more
A rigorous mathematical programming framework for the scheduling of multipurpose batch plants operated in a cyclic mode is presented and it is shown that it is sufficient for the formulation to characterize a single cycle of the periodic schedule despite the existence of tasks that span two successive cycles.
The IMA volumes in mathematics and its applicationsMixed-Integer Nonlinear Programming: A Survey of Algorithms and Applications
92 Citations1997Ignacio E. Grossmann, Zdravko Kravanja
This paper presents an overview of mixed-integer nonlinear programming techniques by first providing a unified treatment of the Branch and Bound, Outer-Approximation, Generalized Benders and Extended Cutting Plane methods as applied to nonlinear discrete optimization problems that are expressed in algebraic form.
Chemical Engineering and Processing - Process IntensificationExperiments in process synthesis via mixed-integer programming
38 Citations1989Xiaojun Yuan, L. Pibouleau +1 more
This work aims at going still further in the solution of mixed problems with non-Boolean variables, nonlinear and nonseparable constraints and criteria, by presenting and illustrated by two examples of processes.
Oil and Gas Journal; (USA)Saudi ethylene plants move toward more feed flexibility
9 Citations1990A.K.K. Lee, Abdullah Aitani
Computers & Chemical EngineeringOptimal periodic scheduling of multipurpose plants in the continuous time domain
8 Citations1997G. Schilling, Constantinos C. Pantelides
The paper describes a special branch-and-bound algorithm for solving the problem of determining an optimal periodic schedule for multipurpose plants comprising batch, semi-batch and continuous operations by branching on both discrete and continuous variables.