Anda di halaman 1dari 10

PT AU BA CA GP RI OI BE Z2 TI

X1 Y1 Z1 FT PN AE Z3 SO S1 SE
BS VL IS SI MA BP EP AR DI D2
SU PD PY AB X4 Y4 Z4 AK CT CY
SP CL TC Z8 ZR ZB ZS Z9 U1 U2
SN EI BN UT PM
J Applequist, G; Samikoglu, O; Pekny, J; Reklaitis, G
Issues in the use, design and evolution of process scheduling and planning syste
ms ISA TRANSACTIONS
36 2 81 121 10.1016/S0019-0578(97)00
018-9 1997 1997 This paper reviews the basic terminology
associated with process scheduling and planning problems, the technical issues
underlying their formulation and solution, and the considerations associated wit
h installing, scheduling and planning software. This review motivates a discussi
on of next generation scheduling and planning technology. Examples are provided
to illustrate both basic applications, and to show the scope of industrial scale
problems. (C) 1997 Elsevier Science Ltd.
0019-0578 WOS:A1997YJ84100002
J Ben-Tal, A; Nemirovski, A Nemirovski, Arka
di/A-8375-2009 Nemirovski, Arkadi/0000-0002-5001-7420 Robust s
olutions of Linear Programming problems contaminated with uncertain data
MATHEMATICAL PROGRAMMING 88 3
411 424 10.1007/PL00011380 SEP 2000
2000 Optimal solutions of Linear Programming problems may become severely inf
easible if the nominal data is slightly perturbed. We demonstrate this phenomeno
n by studying 90 LPs from the well-known NETLIB collection. We then apply the Ro
bust Optimization methodology (Ben-Tal and Nemirovski [1-3]; El Ghaoui et al. [5
,6]) to produce "robust" solutions of the above LPs which are in a sense immuned
against uncertainty. Surprisingly, for the NETLIB problems these robust solutio
ns nearly lose nothing in optimality.
0025-5610 WOS:000089510700001
J Blomer, F; Gunther, HO
Scheduling of a multi-product batch process in the chemical industry
COMPUTERS IN INDUSTRY 36 3
245 259 10.1016/S0166-3615(98)00075-X JUN 1 19
98 1998 We present an example of a mixed-integer linear programming (MIL
P) model for the scheduling of a multi-product batch process occurring in the ch
emical industry. The batch process considered is organized in several stages. Va
rious final products are produced out of a single feedstock by a number of chemi
cal processes. The major scheduling objective is to minimize the makespan, i.e.,
to complete the required production operations within the shortest possible tim
e. The complexity of the scheduling problem is determined by such factors as var
iable batch sizes, shared intermediates, flexible proportions of output goods, b
lending processes, sequence and usage dependent cleaning operations, finite inte
rmediate storage, cyclical material flows, and no-wait production for certain ty
pes of products. Due to the fact that computational times are prohibitive for pr
oblems of realistic size, we developed various LP-based heuristics. The heuristi
cs proposed are applied to relaxations of the original multi-period MILP model.
Thus, computational results are obtained a magnitude faster. Furthermore, near-o
ptimal solutions are made possible for larger problems within seasonable computa
tional time. In order to evaluate the applicability of the heuristics, a number
of numerical experiments were performed. (C) 1998 Elsevier Science B.V. All righ
ts reserved. 2nd International Conference on
Computer Integrated Manufacturing in the Process Industries, I-CIMPRO2nd Interna
tional Conference on Computer Integrated Manufacturing in the Process Industries
, I-CIMPRO JUN 03-04, 1996JUN 03-04, 1996 EINDHOVEN, NETHERLANDSEI
NDHOVEN, NETHERLANDS
0166-3615 WOS:000074982700007
J Blomer, F; Gunther, HO
LP-based heuristics for scheduling chemical batch processes
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 38
5 1029 1051 10.1080/002075400189004
MAR 20 2000 2000 A mixed-integer linear programming (MILP) model for sche
duling chemical batch processes is presented. Since computational times are proh
ibitive for most problems of realistic size, a two-stage solution procedure is s
uggested. In the first stage, an initial solution is derived by use of a LP-base
d heuristic. The proposed heuristic defines a time grid that includes only a lim
ited number of feasible periods in which a processing task is allowed to start.
Thus, the size of the original multi-period MILP model is reduced in a controlle
d manner and optimal solutions to the relaxed model are obtained within reasonab
le computational time. The second stage consists of an improvement step that aim
s to compress the initial schedule by left-shifting operations over the time-axi
s. In order to evaluate the applicability of the heuristics a number of numerica
l experiments were performed. It is shown that near-optimal solutions are obtain
ed for large-size problems with only modest computational effort.
0020-7543 WOS:000085876200003
J Brucker, P; Drexl, A; Mohring, R; Neumann, K; Pesch, E
Resource-constrained project scheduling: Notation, classification, models, and m
ethods EUROPEAN JOURNAL
OF OPERATIONAL RESEARCH 112 1
3 41 10.1016/S0377-2217(98)00204-5 JAN 1 19
99 1999 Project scheduling is concerned with single-item or small batch
production where scarce resources have to be allocated to dependent activities o
ver time. Applications can be found in diverse industries such as construction e
ngineering, software development, etc. Also, project scheduling is increasingly
important for make-to-order companies where the capacities have been cut down in
order to meet lean management concepts. Likewise, project scheduling is very at
tractive for researchers, because the models in this area are rich and, hence, d
ifficult to solve. For instance, the resource-constrained project scheduling pro
blem contains the job shop scheduling problem as a special case. So far, no clas
sification scheme exists which is compatible with what is commonly accepted in m
achine scheduling. Also, a variety of symbols are used by project scheduling res
earchers in order to denote one and the same subject. Hence, there is a gap betw
een machine scheduling on the one hand and project scheduling on the other with
respect to both, viz. a common notation and a classification scheme. As a matter
of fact, in project scheduling, an ever growing number of papers is going to be
published and it becomes more and more difficult for the scientific community t
o keep track of what is really new and relevant. One purpose of our paper is to
close this gap. That is, we provide a classification scheme, i.e. a description
of the resource environment, the activity characteristics, and the objective fun
ction, respectively, which is compatible with machine scheduling and which allow
s to classify the most important models dealt with so far. Also, we propose a un
ifying notation. The second purpose of this paper is to review some of the recen
t developments. More specifically, we review exact and heuristic algorithms for
the single-mode and the multi-mode case, for the time-cost tradeoff problem. for
problems with minimum and maximum time lags, for problems with other objectives
than makespan minimization and, last but not least, for problems with stochasti
c activity durations. (C) 1999 Elsevier Science B.V. All rights reserved.
0377-2217 WOS:000077244500002
J Burkard, RE; Hujter, M; Klinz, B; Rudolf, R; Wennink, M
Hujter, Mihaly/H-7097-2012 A process scheduling pro
blem arising from chemical production planning
OPTIMIZATION METHODS & SOFTWARE 10 2
175 196 10.1080/10556789808805710 1998
1998 In this paper we investigate scheduling problems which stem from real-wo
rld applications in the chemical process industry both from a theoretical and fr
om a practical point of view.After providing a survey and a general mixed intege
r programming model, we present some results on the complexity of the process sc
heduling problem and investigate some important special cases. (We prove the NP-
hardness in general and the polynomial solvability for specially structured case
s.) Furthermore, we suggest a new heuristic approach and compare this to other h
euristics known from the literature.
1055-6788 WOS:000079872500006
J Caroe, CC; Schultz, R
Dual decomposition in stochastic integer programming
OPERATIONS RESEARCH LETTERS 24 1-2
37 45 10.1016/S0167-6377(98)00050-9 FEB-MAR
1999 1999 We present an algorithm for solving stochastic integer programmi
ng problems with recourse, based on a dual decomposition scheme and Lagrangian r
elaxation. The approach can be applied to multi-stage problems with mixed-intege
r variables in each time stage. Numerical experience is presented for some two-s
tage test problems. (C) 1999 Elsevier Science B.V. All rights reserved.
0167-6377 WOS:000079756600006
J CERDA, J; VICENTE, M; GUTIERREZ, JM; ESPLUGAS, S; MATA, J
Esplugas, Santiago/D-4652-2014; Gutierrez, Jose Maria/L-5224-2014; Mata-Alvarez,
Joan/K-9683-2014 Esplugas, Santiago/0000-0002-3693-2948; Gutierrez, Jose
Maria/0000-0001-7590-2568; Mata-Alvarez, Joan/0000-0002-4570-7152
A NEW METHODOLOGY FOR THE OPTIMAL-DESIGN AND PRODUCTION SCHEDULE OF MULTIPURPOSE
BATCH PLANTS INDUSTRI
AL & ENGINEERING CHEMISTRY RESEARCH 28 7
988 998 10.1021/ie00091a016 JUL 1989
1989
0888-5885 WOS:A1989AE83900016
J CHRISTOFIDES, N; ALVAREZVALDES, R; TAMARIT, JM
Alvarez-Valdes, Ramon/K-5271-2014; Tamarit, Jose/L-6403-2014
PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS - A BRANCH AND BOUND APPROACH
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 29
3 262 273 10.1016/0377-2217(87)90240-2
JUN 1987 1987
0377-2217 WOS:A1987H849500003
J De Reyck, B; Herroelen, W
A branch-and-bound procedure for the resource-constrained project scheduling pro
blem with generalized precedence relations
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 111
1 152 174 10.1016/S0377-2217(97)00305-6
NOV 16 1998 1998 We present an optimal solution procedure for the resourc
e-constrained project scheduling problem (RCPSP) with generalized precedence rel
ations (RCPSP-GPR) with the objective of minimizing the project makespan. The RC
PSP-GPR extends the RCPSP to arbitrary minimal and maximal time lags between the
starting and completion times of activities. The proposed procedure is suited f
or solving a general class of project scheduling problems and allows for arbitra
ry precedence constraints, activity ready times and deadlines, multiple renewabl
e resource constraints with time-varying resource requirements and availabilitie
s, several types of permissible and mandatory activity overlaps and multiple pro
jects. It can be extended to other regular and non-regular measures of performan
ce. Essentially, the procedure is a depth-first branch-and-bound algorithm in wh
ich the nodes in the search tree represent the original project network extended
with extra precedence relations to resolve a number of resource conflicts. Thes
e conflicts are resolved using the concept of minimal delaying modes, which is a
n extension of the notion of minimal delaying alternatives for the RCPSP. Severa
l bounds and dominance rules are used to fathom large portions of the search tre
e. Extensive computational experience is reported. (C) 1998 Elsevier Science B.V
. All rights reserved.
0377-2217 WOS:000075870900011
J Dorndorf, U; Pesch, E; Phan-Huy, T
A time-oriented branch-and-bound algorithm for resource-constrained project sche
duling with generalised precedence constraints
MANAGEMENT SCIENCE 46 10
1365 1384 10.1287/mnsc.46.10.1365.12272 OCT 2000
2000 Resource-constrained project scheduling with generalised precedence cons
traints is a very general scheduling model with applications in areas such as ma
ke-to-order production planning. We describe a time-oriented branch-and-bound al
gorithm that uses constraint-propagation techniques which actively exploit the t
emporal and resource constraints of the problem in order to reduce the search sp
ace. Extensive computational experiments with systematically generated test prob
lems show that the algorithm solves more problems to optimality than other exact
solution procedures which have recently been proposed, and that the truncated v
ersion of the algorithm is also a very good heuristic.
0025-1909 WOS:000165320400007
J Dorndorf, U; Pesch, E; Phan-Huy, T
A branch-and-bound algorithm for the resource-constrained project scheduling pro
blem MATHEMATICAL MET
HODS OF OPERATIONS RESEARCH 52 3
413 439 DEC 2000 2000 We descr
ibe a time-oriented branch-and-bound algorithm for the resource-constrained proj
ect scheduling problem which explores the set of active schedules by enumerating
possible activity start times, The algorithm uses constraint-propagation techni
ques that exploit the temporal and resource constraints of the problem in order
to reduce the search space. Computational experiments with large, systematically
generated benchmark test sets, ranging in size from thirty to one hundred and t
wenty activities per problem instance, show that the algorithm scales well and i
s competitive with other exact solution approaches. The computational results sh
ow that the most difficult problems occur when scarce resource supply and the st
ructure of the resource demand cause a problem to be highly disjunctive.
1432-2994 WOS:000166482000005
J DREXL, A; HAASE, K
PROPORTIONAL LOTSIZING AND SCHEDULING
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 40
1 73 87 10.1016/0925-5273(95)00040-U
JUN 1995 1995 Two multi-item capacitated dynamic lotsizing and schedul
ing models with a finite horizon have been established recently: the discrete lo
tsizing and scheduling problem as well as the continuous setup lotsizing problem
. An analysis of the underlying fundamental assumptions provides the basis for i
ntroducing a new model, the proportional lotsizing and scheduling problem. We pr
esent a new backward-oriented regret-based biased random sampling method which s
olves the new model efficiently. The model is well suited for the incorporation
of some of the extensions relevant for practice: setup times, sequence-dependent
setup costs (times), multiple machines as well as multiple stages.
0925-5273 WOS:A1995RZ74500007
J EGLESE, RW
SIMULATED ANNEALING - A TOOL FOR OPERATIONAL-RESEARCH
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 46
3 271 281 10.1016/0377-2217(90)90001-R
JUN 15 1990 1990
0377-2217 WOS:A1990DP36800001
J Engell, S; Markert, A; Sand, G; Schultz, R; Schutz, C
Grotschel, M; Krumke, SO; Rambau, J Online scheduling of multiproduc
t batch plants under uncertainty
ONLINE OPTIMIZATION OF LARGE SCALE SYSTEMS
649 676 2001 2001
CCC:000175770300032
J Grossmann, IE; Caballero, JA; Yeomans, H
Caballero, Jose/B-7567-2011 Caballero, Jose/0000-0001-6470-2907
Mathematical programming approaches to the synthesis of chemical process systems
KOREAN JOURNAL OF CHEMICAL ENGINEERING 16 4
407 426 10.1007/BF02698263 JUL 1999
1999 This paper presents a review of advances that have taken place in the ma
thematical programming approach to process design and synthesis. A review is fir
st presented on the algorithms that are available for solving MINLP problems, an
d its most recent variant, Generalized Disjunctive Programming models. The formu
lation of superstructures, models and solution strategies is also discussed for
the effective solution of the corresponding optimization problems. The rest of t
he paper is devoted to reviewing recent mathematical programming models for the
synthesis of reactor networks, distillation sequences, heat exchanger networks,
mass exchanger networks, utility plants, and total flowsheets. As will be seen f
rom this review, the progress that has been achieved in this area over the last
decade is very significant.
0256-1115 WOS:000082172200001
J Grunow, M; Gunther, HO; Lehmann, M Grunow,
Martin/C-6725-2008 Campaign planning for multi-stag
e batch processes in the chemical industry
OR SPECTRUM 24 3 281
314 AUG 2002 2002 Inspired by a ca
se study from industry, the production of special chemical products is considere
d. In this industrial environment, multi-purpose equipment is operated in batch
mode to carry out the diverse processing tasks. Often, extensive set-up and clea
ning of the equipment are required when production switches between different ty
pes of products. Hence, processes are scheduled in campaign mode, i.e. a number
of batches of the same type are processed in sequence. ne production of chemical
products usually involves various stages with significant cumulative lead times
. Typically, these production stages are assigned to different plants. A hierarc
hical modelling approach is presented which co-ordinates the various plant opera
tions within the entire supply network. In the first stage, the length of the ca
mpaigns, their timing, the corresponding material flows, and equipment requireme
nts have to be determined. At this stage, an aggregation scheme based on feasibi
lity constraints is employed in order to reflect the limited availability of the
various types of production equipment. The second stage consists of an assignme
nt model, which allocates the available equipment units between the production c
ampaigns determined in the first stage of the solution procedure. In the third s
tage, resource conflicts are resolved, which may occur if clean-out operations a
nd minimal campaign lengths have to be considered. The proposed hierarchical app
roach allows a more compact model formulation compared to other approaches known
from the literature. As a result, a very efficient and flexible solution approa
ch is obtained. In particular, commercially available standard solvers can be us
ed to solve a wide range of campaign planning problems arising in the chemical i
ndustry.
0171-6468 WOS:000178309100003
J Harjunkoski, I; Jain, V; Grossman, IE Harjunko
ski, Iiro/G-2282-2016 Harjunkoski, Iiro/0000-0003-0428-0751
Hybrid mixed-integer/constraint logic programming strategies for solving schedul
ing and combinatorial optimization problems
COMPUTERS & CHEMICAL ENGINEERING 24 2-7
337 343 10.1016/S0098-1354(00)00470-1 JUL 15 2
000 2000 In this paper, we present two methods to overcome the combinator
ial complexity when solving large discrete optimization problems. The basic idea
relies on combining mixed integer programming (MIP) and constraint logic progra
mming (CLP) to exploit their complementary strengths. These strategies are illus
trated in the area of job-shop scheduling and trim-loss problems. Comparisons of
the strategies are presented with direct solutions on MIP and CLP problems. (C)
2000 Elsevier Science Ltd. All rights reserved.
7th International Symposium on Process Systems Engineering7th International Symp
osium on Process Systems Engineering JUL 16-21, 2000JUL 16-21, 2000 CACHE Co
rp; AICHE, Comp & Syst Techno DivCACHE Corp; AICHE, Comp & Syst Techno Div
KEYSTONE, COKEYSTONE, CO
0098-1354 WOS:000088546800028
J Jain, V; Grossmann, IE
Algorithms for hybrid MILP/CP models for a class of optimization problems
INFORMS JOURNAL ON COMPUTING 13 4
258 276 10.1287/ijoc.13.4.258.9733 FAL 2001
2001 The goal of this paper is to develop models and methods that use complem
entary strengths of Mixed Integer Linear Programming (MILP) and Constraint Progr
amming (CP) techniques to solve problems that are otherwise intractable if solve
d using either of the two methods. The class of problems considered in this pape
r have the characteristic that only a subset of the binary variables have non-ze
ro objective function coefficients if modeled as an MILP. This class of problems
is formulated as a hybrid MILP/CP model that involves some of the MILP constrai
nts, a reduced set of the CP constraints, and equivalence relations between the
MILP and the CP variables. An MILP/CP based decomposition method and an LP/CP-ba
sed branch-and-bound algorithm are proposed to solve these hybrid models. Both t
hese algorithms rely on the same relaxed MILP and feasibility CP problems. An ap
plication example is considered in which the least-cost schedule has to be deriv
ed for processing a set of orders with release and due dates using a set of diss
imilar parallel machines. It is shown that this problem can be modeled as an MIL
P, a CP a combined MILP-CP OPL model (Van Hentenryck 1999), and a hybrid MILP/CP
model. The computational performance of these models for several sets shows tha
t the hybrid MILP/CP model can achieve two to three orders of magnitude reductio
n in CPU time.
1091-9856 1526-5528 WOS:000172642700002
J Kallrath, J
Mixed integer optimization in the chemical process industry - Experience, potent
ial and future perspectives
CHEMICAL ENGINEERING RESEARCH & DESIGN 78 A6
809 822 10.1205/026387600528012 SEP 2000
2000 Proper organization, planning and design of production, storage location
s, transportation and scheduling are vital to retain the competitive edge of com
panies in the global economy. Typical additional problems in the chemical indust
ry suitable for optimization are process design, process synthesis and multi-com
ponent blended-flow problems leading to nonlinear or even mixed integer nonlinea
r models. Mixed integer optimization (MIP) determines optimal solutions of such
complex problems; the development of new algorithms, software and hardware allow
the solution of larger problems in acceptable times.This tutorial paper address
es two groups. The focus towards the first group (managers and senior executives
) and readers who are not very familiar with mathematical programming is to crea
te some awareness regarding the potential benefits of MIP, to transmit a sense o
f what kind of problems can be tackled, and to increase the acceptance of MIP. T
he second group (a more technical audience with some background in mathematical
optimization), might rather appreciate the state-of-the-art view on good-modelli
ng practice, algorithms and an outlook into global optimization.Some real-world
MIP problems solved by BASF's mathematical consultants are briefly described, am
ong them discrete blending and multi-stage production planning and distribution
with several sites, products and periods. Finally, there is a focus on future pe
rspectives and sources of MIP support are indicated from academia, software prov
iders and consulting firms.
0263-8762 WOS:000165255500002
S Kallrath, J; Schreieck, A
Hertzberger, B; Serazzi, G Discrete optimisation and real world pro
blems HIGH-PERFORMANCE
COMPUTING AND NETWORKING LECTURE NOTES IN COMPUTER SCIENCE
919 351 359
1995 1995 In the global economy, proper organisation and planning of produ
ction and storage locations, transportation and scheduling are vital to retain t
he competitive edge of companies. The planning and scheduling problems involved
are immensely complex. Computer-based optimisation techniques are the best means
of obtaining viable solutions, but until now the mixed integer programs develop
ed have been able to deal only with simple problems. The more important larger p
roblems have generally been solved using ad-hoc heuristics which often produce i
ncomplete and less satisfactory solutions. Today, the development of new algorit
hms, software and hardware is leading to the provision of mathematical applicati
ons and tools which allow the solution of these larger problems in acceptable ti
mes. In this contribution two groups are addressed: on the one hand managers, an
d on the other hand a more technical oriented audience. The focus towards the fi
rst group is to create some attention with respect to the potential benefits of
the method, to transmit a sense of what kind of problems can be tackled, and to
increase the acceptance of the approach based on mixed-integer optimisation. The
second group will be informed about the state-of-the-art, especially with respe
ct to the use of high-performance computers and modern algorithmic aspects.
International Conference and Exhibition on High-Performance Computing and Networ
kingInternational Conference and Exhibition on High-Performance Computing and Ne
tworking MAY 03-05, 1995MAY 03-05, 1995 MILAN, ITALYMILAN, ITALY
0302-9743 3-540-59393-4 WOS:A1995BE66H00052
J Kallrath, J
Combined strategic and operational planning - an MILP success story in chemical
industry OR SPECT
RUM 24 3 315 341
AUG 2002 2002 We describe and solve a real world problem in chemical i
ndustry which operational planning with strategic aspects. In our simultaneous s
trategic & operational planning (SSDOP) approach we develop a model based on mix
ed-integer linear (MILP) optimization and apply it to a real-world problem; the
approach seems to be applicable in many other situations provided that people in
production planning, process development, strategic and financial planning depa
rtments cooperate.The problem is related to the supply chain management of a mul
ti-site production network in which production units are subject to purchase, op
ening or shutdown decisions leading to an MILP model based on a time-indexed for
mulation. Besides the framework of the SSDOP approach and consistent net present
value calculations, this model includes two additional special and original fea
tures: a detailed nonlinear price structure for the raw material purchase model,
and a detailed discussion of transport times with respect to the time discretiz
ation scheme involving a probability concept, In a maximizing net profit scenari
o the client reports cost saving of several millions US$.The strategic feature p
resent in the model is analyzed in a consistent framework based on the operation
al planning model, and vice versa. The demand driven operational planning part l
inks consistently to and influences the strategic. Since the results (strategic
desicions or designs) have consequences for many years, and depend on demand for
ecast. raw material availability, and expected costs or sales prices, resp., a c
areful sensitivity analysis is necessary showing how stable the decisions might
be with respect to these input data.
0171-6468 WOS:000178309100004
J KONDILI, E; PANTELIDES, CC; SARGENT, RWH
A GENERAL ALGORITHM FOR SHORT-TERM SCHEDULING OF BATCH-OPERATIONS .1. MILP FORMU
LATION COMPUTERS & CHEM
ICAL ENGINEERING 17 2
211 227 10.1016/0098-1354(93)80015-F FEB 1993
1993 A general framework for handling a wide range of scheduling problems ari
sing in multiproduct/multipurpose batch chemical plants is presented.Batch proce
sses involving a variety of complexities are represented using a state-task netw
ork. The novel feature of this representation is that both the individual batch
operations (''tasks'') and the feedstocks, intermediate and final products (''st
ates'') are included explicitly as network nodes. Processes involving sharing of
raw materials and inter-mediates, batch splitting and mixing and recycles of ma
terial, can be represented unambiguously as such networks.The short-term schedul
ing problem is formulated as a mixed integer linear program (MILP) based on a di
screte time representation. Flexible equipment allocation, variable batchsizes a
nd mixed intermediate storage policies involving both dedicated and multipurpose
storage vessels are taken into account. Limited availability of raw materials,
both at the start and during the time horizon of interest, is accommodated. Prod
uct deliveries may take place at any time during the horizon, and the amounts in
volved may be either fixed or variable. The use of utilities by the various task
s may vary over the task processing time, and may be constant or proportional to
the batchsize. The availability and/or cost of utilities may vary over the time
horizon of interest.The objective function is the maximization of a profit func
tion involving the value of the products, and the cost of raw materials, utiliti
es and material storage.The formulation may result in MILPs involving large numb
ers of binary variables. Issues pertaining to the efficient solution of these pr
oblems are discussed in Part II of this paper.
0098-1354 WOS:A1993KM65800006
S Mohring, RH; Schulz, AS; Stork, F; Uetz, M
Nesetril, J Resource-constrained project scheduling: Computing lower
bounds by solving minimum cut problems
ALGORITHMS - ESA'99 LECTURE NOTES IN COMPUTER SCIENCE
1643 139 150
1999 1999 We present a novel approach to compute Lagrangian lower bounds o
n the objective function value of a wide class of resource-constrained project s
cheduling problems. The basis is a polynomial-time algorithm to solve the follow
ing scheduling problem: Given a set of activities with start-time dependent cost
s and temporal constraints in the form of time windows, find a feasible schedule
of minimum total cost. In fact, we show that any instance of this problem can b
e solved by a minimum cut computation in a certain directed graph.We then discus
s the performance of the proposed Lagrangian approach when applied to various ty
pes of resource-constrained project scheduling problems. An extensive computatio
nal study based on different established test beds in project scheduling shows t
hat it can significantly improve upon the quality of other comparably fast compu
table lower bounds. 7th Annual European Symp
osium on Algorithms (ESA 99)7th Annual European Symposium on Algorithms (ESA 99)
JUL 16-18, 1999JUL 16-18, 1999 Ctr Discrete Math Theoret Comp Sci & Applicat; C
harles Univ; Czech Acad Sci; Inst Chem TechnolCtr Discrete Math Theoret Comp Sci
& Applicat; Charles Univ; Czech Acad Sci; Inst Chem Technol PRAGUE, CZECH RE
PUBLICPRAGUE, CZECH REPUBLIC
0302-9743 3-540-66251-0 WOS:000084091000012
J Neumann, K; Schwindt, C; Trautmann, N
Advanced production scheduling for batch plants in process industries
OR SPECTRUM 24 3 251
279 AUG 2002 2002 An Advanced Plan
ning System (APS) offers support at all planning levels along the supply chain w
hile observing limited resources. We consider an APS for process industries (e.g
. chemical and pharmaceutical industries) consisting of the modules network desi
gn (for long-term decisions), supply network planning (for medium-term decisions
), and detailed production scheduling (for short-term decisions). For each modul
e, we outline the decision problem, discuss the specifics of process industries.
and review state-of-the-art solution approaches. For the module detailed produc
tion scheduling, a new solution approach is proposed in the case of batch produc
tion, which can solve much larger practical problems than the methods known thus
far. The new approach decomposes detailed production scheduling for batch produ
ction into hatching and batch scheduling. The batching problem converts the prim
ary requirements for products into individual batches, where the workload is to
be minimized. We formulate the hatching problem as a nonlinear mixed-integer pro
gram and transform it into a linear mixed-binary program of moderate size. which
can be solved by standard software. The batch scheduling problem allocates the
batches to scarce resources such as processing units, workers, and intermediate
storage facilities, where some regular objective function like the makespan is t
o be minimized. The batch scheduling problem is modelled as a resource-constrain
ed project scheduling problem, which can be solved by an efficient truncated bra
nch-and-bound algorithm developed recently. The performance of the new solution
procedures for hatching and batch scheduling is demonstrated by solving several
instances of a case study from process industries.
0171-6468 WOS:000178309100002
J PRITSKER, AAB; WATTERS, LJ; WOLFE, PM
MULTIPROJECT SCHEDULING WITH LIMITED RESOURCES - ZERO-ONE PROGRAMMING APPROACH
MANAGEMENT SCIENCE SERIES A-THEORY 16 1
93 108 10.1287/mnsc.16.1.93 1969 1969
WOS:A1969Y560900007
J Sand, G; Engell, S; Markert, A; Schultz, R; Schulz, C
Approximation of an ideal online scheduler for a multiproduct batch plant
COMPUTERS & CHEMICAL ENGINEERING 24 2-7
361 367 10.1016/S0098-1354(00)00473-7 JUL 15 2
000 2000 In this contribution we present an online scheduling algorithm f
or a real world multiproduct batch plant, which includes an explicit representat
ion of uncertainties. An ideal online scheduler is approximated by a hierarchica
l approach with two-levels, on which optimisation problems are formulated as mat
hematical programs and solved by non-standard algorithms. The focus is on the hi
erarchical framework and the upper level planning problem where uncertainties ar
e modelled explicitly. The key features of the planning model and of the solutio
n algorithm are explained and numerical results are presented. (C) 2000 Elsevier
Science Ltd. All rights reserved. 7th Inte
rnational Symposium on Process Systems Engineering7th International Symposium on
Process Systems Engineering JUL 16-21, 2000JUL 16-21, 2000 CACHE Corp; AICH
E, Comp & Syst Techno DivCACHE Corp; AICHE, Comp & Syst Techno Div KEYSTONE
, COKEYSTONE, CO
0098-1354 WOS:000088546800031
J SAWIK, TJ Sawik, Tadeusz/D-1240-2013
Sawik, Tadeusz/0000-0002-6054-550X MULTILEVEL SCHEDULING OF
MULTISTAGE PRODUCTION WITH LIMITED IN-PROCESS INVENTORY
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 38
7 651 664 10.2307/2582402
JUL 1987 1987
0160-5682 WOS:A1987J317800010
J SCHULTZ, R
ON STRUCTURE AND STABILITY IN STOCHASTIC PROGRAMS WITH RANDOM TECHNOLOGY MATRIX
AND COMPLETE INTEGER RECOURSE
MATHEMATICAL PROGRAMMING 70 1
73 89 10.1007/BF01585929 OCT 20 1995
1995 For two-stage stochastic programs with integrality constraints in the se
cond stage, we study continuity properties of the expected recourse as a functio
n both of the first-stage policy and the integrating probability measure.Suffici
ent conditions for lower semicontinuity, continuity and Lipschitz continuity wit
h respect to the first-stage policy are presented. Furthermore, joint continuity
in the policy and the probability measure is established. This leads to conclus
ions on the stability of optimal values and optimal solutions to the two-stage s
tochastic program when subjecting the underlying probability measure to perturba
tions.
0025-5610 WOS:A1995TF47300005
J Schwindt, C; Trautmann, N
Batch scheduling in process industries: an application of resource-constrained p
roject scheduling
OR SPEKTRUM 22 4 501
524 NOV 2000 2000 The paper deals
with batch scheduling problems in process industries where final products arise
from several successive chemical or physical transformations of raw materials us
ing multi-purpose equipment. In batch production mode, the total requirements of
intermediate and final products are partitioned into batches. The production st
art of a batch at a given level requires the availability of all input products.
We consider the problem of scheduling the production of given batches such that
the makespan is minimized. Constraints like minimum and maximum time lags betwe
en successive production levels, sequence-dependent facility setup times, finite
intermediate storages, production breaks, and time-varying manpower contribute
to the complexity of this problem. We propose a new solution approach using mode
ls and methods of resource-constrained project scheduling, which (approximately)
solves problems of industrial size within a reasonable amount of time.
0171-6468 WOS:000165441400004
S Sgall, J Sgall, Jiri/H-3151-2014 Sgall, J
iri/0000-0003-3658-4848 Fiat, A; Woeginger, GJ On-line scheduling
ONLINE ALGORITHMS: THE STATE OF THE ART Lecture Notes in Computer Scienc
e 1442 196 231
1998 1998
0302-9743 3-540-64917-4 WOS:000082482100009
J SHAH, N; PANTELIDES, CC; SARGENT, RWH Shah, Ni
lay/E-4925-2015 Shah, Nilay/0000-0002-8906-6844 A GENERAL ALGORI
THM FOR SHORT-TERM SCHEDULING OF BATCH-OPERATIONS .2. COMPUTATIONAL ISSUES
COMPUTERS & CHEMICAL ENGINEERING 17 2
229 244 10.1016/0098-1354(93)80016-G FEB 1993
1993 The first part of this paper (p. 211) presented a general mathematical f
ramework for describing a wide variety of scheduling problems arising in multipr
oduct/multipurpose batch chemical plants. The problem is formulated as a large m
ixed integer linear programming model (MILP).We describe a variety of techniques
that exploit the characteristics of the problem in order to reduce the amount o
f computation required. These include reformulation of some of the constraints,
derivation of an alternative and much more compact linear programming relaxation
of the MILP, and reduction of the non-integrality of the solutions of relaxed L
Ps through their a posteriori analysis. The combination of the three measures re
sults in a significant improvement in computational performance without compromi
sing the optimality of the solution obtained.A case study is presented to illust
rate the applicability of the method to the scheduling of multipurpose plants un
der a variety of operational constraints.
0098-1354 WOS:A1993KM65800007