Professional Documents
Culture Documents
a r t i c l e i n f o a b s t r a c t
Article history: Electroplating industry annually produces numerous plated workpieces for U.S. pillar industries.
Received 4 April 2011 However, it is also a major environment polluter in forms of wastewater, sludge, and spent solution.
Received in revised form Thus, waste source reduction for the electroplating industry is a must. In practice, when productivity
16 August 2011
and energy use efficiency are also taken into account, the design and operation of an electroplating
Accepted 14 September 2011
Available online 24 September 2011
process become very complicated and need an in-depth study. In this paper, productivity maximiza-
tion, energy saving, and freshwater/wastewater minimization are simultaneously addressed for the
Keywords: optimal design and operation of electroplating processes, which generates a triple-objective mixed-
Hoist scheduling integer dynamic optimization (MIDO) model. The MIDO model is iteratively solved by a developed
Water network synthesis
methodology to obtain the 3D Pareto frontier of the optimization problem, which provides important
Energy saving
technical supports for the design and operation of electroplating processes. The efficacy has been
Optimization
MINLP demonstrated with a case study on an electroplating process.
Pareto frontier Published by Elsevier Ltd.
can improve production efficiency and reduce manufacturing cost becomes a multi-objective mixed-integer dynamic optimization
significantly. As reported, up to a 20% reduction in mean product (MIDO) problem. Recent advances in MIDO study include applica-
waiting time and about a 50% improvement in standard deviation tions in batch process synthesis and development, design of batch
of cycle time can be obtained in operation through optimal distillation columns, solvent design in batch processes, simulta-
scheduling (Kumar, 1994). neous design and control, reduction of kinetic mechanisms, and
Fig. 1 depicts a simplified electroplating process where a hoist optimization of hybrid discrete/continuous systems (Abel and
moves above the electroplating line where multi-step cleaning, Marquardt, 2000; Flores-Tlacuahuac and Biegler, 2007; Terrazas-
rinsing, and plating operations occur in different processing units. Moreno et al., 2007), and solving algorithms development that are
The parts (called jobs) are loaded into a barrel at one end of the better for solving larger and more realistic problems (Allgor and
plating line, which is a loading/unloading zone. The processing Barton, 1999; Bansal et al., 2003; Chachuat et al., 2005). Some
time of each job in a specific unit is usually restricted by the studies on multi-objective optimization of chemical process
processing recipe. A hoist is employed to raise, move, and lease systems also take into account timing issues. For instance,
each job periodically from one unit to the other in the line. Note Busch et al. (2007) presented a multi-objective methodology for
that multiple jobs are simultaneously under processing in a the modeling and dynamic predictive scheduling of operational
production line. Thus, the hoist schedule must be optimally strategies for chemical processes. Prata et al. (2008) presented a
arranged to timely satisfy the processing requests from all the combined discretization scheme for an integrated grade transition
jobs. If the hoist picks up jobs from the loading zone more and production scheduling problem of a continuous polymeriza-
frequently, the production rate is expected to be higher. Hoist tion reactor. Gao et al. (2008) proposed a parallel hybrid multi-
movements can be divided into three types: (i) free move, during objective optimization algorithm to solve the multi-objective
which it does not carry a job; (ii) loaded move, during which the optimization problem of the ethylene furnace production.
hoist carries a job; and (iii) idle waiting, during which the hoist Nowadays, the challenges for the electroplating industry are
rests over a processing unit without a job. The time duration not only issues of product quality, productivity, and pollution
between releasing and lifting a job in a unit suggests the job prevention, but also energy use efficiency. The energy source used
processing time of that unit. in this industry is electricity and it is mainly used for bath heating
Cyclic hoist scheduling (CHS) involves solution identifications and electroplating operation. As electricity consumption during
for combining three types of hoist movements in a cyclic way, such electroplating operation heavily depends on the plating time,
that the simple repetition of hoist movement control can produce which actually is affected by the hoist scheduling, the energy-
many jobs with the same processing recipe. CHS had been proven saving opportunities can be embedded into CHS decision mak-
as an NP-hard problem (Lei and Wang, 1989). Historically, hoist ings. In this paper, it is assumed that the energy consumption is
schedules were usually developed based on experience. The first proportionally related to the electroplating time, and the electro-
reported effort for computerized scheduling was made by Phillips plating process will continue under constant voltage and current
and Unger (1976). Later, Shapiro and Nuttle (1988) proposed a density as long as the parts are in the plating tank; meanwhile,
linear-programming (LP) based branch and bound algorithm in the energy cost will not change with respect to time.
solution identification. Subsequently, Lei and Wang (1994) and In this paper, the elements of productivity improvement,
Armstrong et al. (1994) improved their solution methods. Baptiste energy saving, and freshwater/wastewater minimization are
et al. (1992) addressed the CHS problem with constraint logic simultaneously addressed in the design and operation of general
programming (CLP) as a modeling language. Rodosek and Wallace electroplating processes. In operation, a linearized CHS model is
(1998) then combined CLP and MIP to generate a hybrid algorithm. employed to minimize the production cycle time so as to improve
Chen et al. (1995) introduced a new branch and bound algorithm the productivity. A plating model measuring the electricity usage
for an improved production efficiency. during the electroplating operation addresses the optimal energy
CHS can also offer environmental benefits. Xu and Huang consumption under the specification of plating quality. In process
(2004) pioneered in this area with a graphic assisted scheduling design, rinse dynamics considered WRND targets the minimum
methodology, which considered fresh water minimization as a freshwater usage (i.e., wastewater generation) through optimal
part of the objective function. The application showed it not only water allocation in various rinse units. The three aspects are
improved the production rate but also reduced the wastewater integrated into a triple-objective MIDO model. The reason for
generation in an electroplating line. With the same idea, Kuntay employing an MIDO model is because the rising operation con-
et al. (2006) developed an MINLP model that took productivity sists of the batch operation of job drag-in/drag-out and the
and chemical consumption into consideration. Xu and Liu (2008) continuous inflow/outflow of rinse water, the rinse water effluent
considered a sequential method to integrate CHS and WRND concentration will dynamically change during a cyclic operation
problems by solving CHS and WRND problems iteratively. Very period. Conceivably, the contaminant concentration of rinse water
recently, Liu et al. (2011) integrated CHS and WRND problems will increase to some extent when a job is just dragged in for
into one model and solved it through an efficient methodology. rinsing; then the concentration will gradually reduce in the left
The simultaneous consideration of CHS and WRND involves cycle time. Thus, in order to reuse rinse water effluent, the rinse
multi-objective programming. When the operational dynamics water concentration dynamics has to be considered. Based on the
(i.e., rinsing dynamics) are taken into account, which are usually structure of the developed multi-objective MIDO model, a decom-
modeled by using ordinary differential equations (ODEs) or posed solving methodology is also developed in this paper to
differential/algebraic equations (DAEs), and the entire problem obtain the 3D Pareto frontier of the optimization problem, which
Hoist
Job
Loading/Unloading
1/8 3 2 74 5 6
provides important technical supports for the design and opera- g j,i ¼ t ej þ Dt fj þ þ 1,i þ Dt w L U
j ; otherwise, gj,i ¼0. g and g are upper and
tion of electroplating processes. The efficacy of the development lower bounds, respectively.
has been demonstrated through a case study on an alkali zinc
g L ð1xj,i Þ r ðt ej þ Dt fj þ þ 1,i þ Dtw U
j Þg j,i r g ð1xj,i Þ, i ¼ 2, , N; j ¼ 1, , N
electroplating process.
ð6Þ
Dtpi oC i T, i ¼ 1, , N ð12Þ
X
N
xi,j ¼ 1, i ¼ 1, , N ð3Þ
j ¼ 1, j a i
Dtpmin
i r Dtpi r Dtpmax
i , i ¼ 1, , N ð13Þ
Eq. (10) is a nonlinear constraint. It can be linearized and
2.1.3. Constraints for starting and ending time of loaded moves replaced by constraints of Eq. (14) through (16) by introducing a
A complete hoist schedule is a cycle that starts and ends at the variable hi and its upper and lower bounds, such as Tmax and Tmin.
same unit. Any unit can be the starting unit of a cycle. Without If yi is 1, hi ¼T; otherwise, hi ¼0.
losing the generality, the staring unit of the first loaded move is Dtpi ¼ tsi tei1 þ ðC i 1ÞT þ hi , i ¼ 1, , N ð14Þ
designated as the initial starting unit. Its starting time is set as
zero as shown in Eq. (4). The starting time of other loaded moves, T min ð1yi Þ r Thi rT max ð1yi Þ, i ¼ 1, , N ð15Þ
t si , is equal to the ending time of the previous loaded move plus
the free move time and hoist waiting time, as shown in Eq. (5). T min yi rhi r T max yi , i ¼ 1, , N ð16Þ
Here, Dt fj þ þ 1,i represents the free move time from the unit where
the j-th loaded move releases a job to the starting unit of the i-th 2.1.5. Hoist cycle time constraints
loaded move. Note that for the j-th loaded move, a job is lifted Eq. (17) calculates the cycle time. Eq. (18) gives the upper and
from the j-th unit and dropped in the unit specified by a prefixed lower bounds of the cycle time.
processing recipe. However, the dropped unit may not be exactly
X
N
indexed by jþ 1. For generality, it can be indexed by jþþ1. T¼ g i,1 ð17Þ
In Eq. (5), xj,i is used to control whether or not the ending time i¼1
of the j-th loaded move t ej , the free move time Dt fj þ þ 1,i , and
waiting time Dt w s T min r T rT max ð18Þ
j , should be counted for calculating t i .
Eq. (5) is a nonlinear constraint, which can be linearized by Compared with other processing units, the electroplating unit
Eq. (6) through (8), where variable gi,j is defined as: if xj,I is 1, then is the largest energy consumer in an electroplating line. As shown
C. Liu et al. / Chemical Engineering Science 68 (2012) 202–214 205
in Eq. (19), the objective here is to minimize the energy con- are processed for one cycle time. As shown in Fig. 2(a), the total
sumption (E) in the electroplating unit. job electroplating time under this scenario is CuTþts te. (ii) On
the other hand, if the hoist schedule indicates that the pickup
J 2 ¼ minE ð19Þ
Dt m operation (ts) is after the drop operation (te) for the electroplating
where m represents the index of jobs processed in the electro- unit, the scenario will be like Fig. 2(b). That means the youngest
plating unit; Dtm is the electroplating time of the m-th job job will be dropped first and the oldest job will be picked up later.
processed in the electroplating unit. Assume the index of electro- Under this situation, there must be Cu jobs in the electroplating
plating unit is u. The electroplating unit is a multi-job unit with unit in the represented cycle, and the total electroplating time is
the simultaneous job-processing capacity of Cu. As the energy (Cu 1)Tþts te (see Fig. 2(b)).
P
consumption is calculated as the electricity usage for electroplat- Based on the above explanation, mDtm in one cycle can be
ts
Cycle Time
Cycle Time
te
ts te
Lengend:
Residence time of the Residence time of the
JobLifting Jobreleasing
youngest job in a cycle oldest job in a cycle
Fig. 2. Illustration for calculating the total electroplating time in a cycle. (a) job lifting before job releasing and (b) job releasing before job lifting.
206 C. Liu et al. / Chemical Engineering Science 68 (2012) 202–214
include all the constraints of the CHS model, which include 2.3.2. Mass balance constraints
Eqs. (2)–(4), (6)–(9), and (11)–(18). Based on the illustration of Fig. 3, Eqs. (30) and (31), respec-
tively, give the mass balance at the inlet and outlet of a rinse unit.
2.3. Modeling for WRND Eq. (32) gives the contaminant mass balance at the inlet of a rinse
unit, where Cf is the contaminant concentration in the fresh
The proposed WRND model is a modification based on recent water; C out
q is the contaminant concentration of W rq, p ; C ak is the
study from Liu et al. (2011). In an electroplating production line, contaminant concentration of W ak,p ; and W wp is the water flow rate
freshwater is consumed in rinse units. To minimize the fresh- directly discharged from the p-th rinse unit to the wastewater
water consumption, rinsing water discharged from other rinse treatment facility. Eq. (33) suggests the contaminant inflow rate
units or some external wastewater streams could be reused. Thus, (i.e., the difference between the drag-in and drag-out rate) is
three types of water sources are functioned as inputs of a rinse exactly equal to the rinse-off rate. Note that the drag-in/drag-out
unit: fresh water, reused water from rinsing units, and reused operations take only d duration.
water from external wastewater represented as W fp , W rq, p , and X
NU X
K
W ak,p , respectively (see Fig. 3). Here, p, q¼1 , y , NR represents W p ¼ W fp þ W rq,p þ W ak,p ð30Þ
the index of a rinse unit; NR is the total number of rinse units in q ¼ 1, q a p k¼1
dC p W p C in
p DC din din din
p ðHðtt p,s ÞHðtt p,e ÞÞ
dt
¼
Vp
þ
Vp Dp ðC din dout out in
p C p ðt p,e ÞÞd ¼ W p ðC p C p ÞT ð33Þ
The proposed WRND model is an MIDO model, where the an interested CHS cycle-time range; then generate the approxi-
dynamic comes from Eq. (26). To facilitate the model solution mated Pareto frontier from the available solution set.
identification, it is converted to an MINLP model with the
orthogonal collocation on finite elements method (Villadsen and 3.1. Methodology framework
Michelsen, 1978; Finlayson, 1980). The derived MINLP model
after the discretization is shown in the Appendix A. The general methodology framework is shown in Fig. 4. It starts
with developing mathematical models for CHS, energy consump-
tion, and WRND. Then, the CHS model will be solved only with
3. Solving strategy of the multi-objective optimization multi-start methods to obtain some feasible solutions. Based on
problem these solutions, an interested CHS cycle-time range can be esti-
mated. Within this range, all integers of cycle time will be
The integrated triple-objective optimization problem contains enumerated in the outer iteration. For each fixed cycle time, energy
three sub optimization models dealing with the productivity optimization model combining a cycle-time equality constraint will
maximization, energy saving, and freshwater minimization. Since be solved for electricity usage minimization. If solution exists, then
these three objectives are mutually influenced, the desirable the discretized WRND model will be solved thereafter. It is worth
solutions are actually the trade-off among these three objectives. noting that under the same CHS cycle time, multiple solutions may
Thus, the in-depth relations for these three objectives should be exist. Under this situation, the inner-loop iteration will be conducted
disclosed. For this purpose, the Pareto frontier of this triple- to find different solutions, where constraints for solution cut
objective optimization problem will be examined. In this paper, (described in Section 3.2) will be accumulated with each feasible
an effective solving strategy for obtaining the Pareto frontier solution. If the inner-loop iteration has no more solutions, it means
of the triple-objective optimization problem is developed. Note the CHS cycle time needs to be adjusted in the outer-loop iteration.
that the integrated triple-objective MIDO model is a nonconvex Iteratively, the solving procedure driven by the outer and inner
nonlinear problem, which is difficult to obtain the global optimal iterations will eventually identify a solution set under the interested
solution. Therefore, the developed solving strategy is to use CHS cycle-time range. Finally, the Pareto frontier approximation of
iteration methods to identify as many solutions as possible in this solution set will be generated for three objectives.
No
No Add Constraints
Solution Exists?
for Solution Cut
Yes
Inner Loop
All the optimization problems are modeled in GAMS (GAMS, voltage (Durney, 1984). The original operation for this electroplat-
1992), where CPLEX and DICOPT are used to solve the MILP ing line features 538 s of CHS cycle time, 42.8 L/min of freshwater
problem and the MINLP problem, respectively; and for MINLP consumption (or wastewater generation), and electricity consump-
problem, CPLEX, and CONOPT are employed to solve the sub-MILP tion of 13.85 kWh per cycle. The basic process parameters and
and NLP problem. (CPLEX, 1995; Drud, 1994; Viswanathan and processing-time information are summarized in Tables 1 and 2.
Grossmann, 1990). Based on the developed solving methodology, 100 feasible
solutions have been identified. Fig. 6 shows the distribution of all
3.2. Solution-cut constraints the identified solutions, which includes the solution from the
previous study (Xu and Huang, 2004). It also illustrates the
CHS may have multiple solutions. Sometimes, there might be approximation of the 3D Pareto frontier surface in the solution
multiple solutions with the same cycle time and even the same space, where minimum CHS cycle time, freshwater usage, and
loaded move sequence. For a specific CHS problem, usually there electricity consumption are pursued. The identified solutions are
is limited number of feasible hoist movement grouping marked in blue, and the Pareto frontier points are marked in red
sequences. For each feasible sequence of grouping movement, circles. There are six cycle time scenarios characterized by the
there are usually an infinite set of solutions with different CHS cycle time ranging from 502 to 507 s. Although solutions
processing time (Subaı̈ et al., 2006). In this paper, integer values with larger cycle time do exist, the smallest cycle-time scenarios
are used for each job processing time and hoist traveling time, so from 502 to 507 s are selected in the outer loop as shown in Fig. 4.
that there are multiple but finite solutions for a given sequence The detailed Pareto frontier results, including the three objective
and a given cycle time. To distinguish different CHS solutions, the values and job processing-time information for each unit, are
starting time of every loaded move is used. The constraint is shown in Table 3. For comparison, the solution results from
shown in Eq. (41). It compares the starting time of each loaded previous study (Xu and Huang, 2004) are also included in Table 3.
move with all the previous solutions. If the summation of the The discretized model is nonconvex (see the Appendix A).
absolute difference between the new solution and every former Although the global solver of BARON has been used, the global
one is nonzero, it means the current solution is a new one. optima cannot be guaranteed due to the complexity of the
integrated model, the ‘‘Pareto frontier surface’’ in Fig. 6 is actually
X
N
9t si t sb,i 9 4 0, b ¼ 1, , NB ð41Þ the best approximation of the real Pareto frontier surface based
i¼1 on the obtained solution set.
where b is the index of identified hoist schedules; NB is the total According to the Pareto frontier surface, as the cycle time
number of CHS solutions that have been identified; t sb,i is the increases, the electricity consumption will increase and the fresh-
starting time of the i-th loaded move identified in the b-th solving water consumption of WRND will decrease. This is understand-
iteration. able because longer cycle time usually results in longer
electroplating time, which will consume more electricity in this
unit. On the other hand, longer cycle time allows more rinse time,
4. Case study which in general allows less rinsing water. Also note that the
solution scattering range under a fixed cycle time is increasing
The developed methodology has been used to solve a real with respect to the cycle time increment. This is because the
electroplating problem (Xu and Huang, 2004). As shown in Fig. 5, larger cycle time allows the hoist to have more options on idle
the electroplating line contains 16 processing units. Since the waiting time and electroplating time, which can generate more
rinsing time in Units 8/10, 14, and 15 and water flows among rinse scenarios and larger differences in freshwater consumption
these units are already fixed, WRND actually only covers rinse among their WRND solutions. These results demonstrate that
units 7, 3, 11, and 5. Meanwhile, the effluent water stream from hoist cycle time, energy consumption, and fresh water usage are
Unit 8/10 is reusable, which can be considered as an external closely related. Even for a fixed cycle time, the electroplating time
wastewater source, with the maximum flow rate of 18.9 L/min. The and WRND should be carefully designed because it does influence
zinc electroplating voltage is 12 V, about the average electroplating the energy and water consumptions.
Yellow chromate
Nitric dip or clear
Drag-in/drag-out
Electroc leaning
Load/unload
Zinc Plating
JS-500 (16)
Rinse (11)
Rinse (14)
Rinse (15)
Rinse (5)
Rinse (7)
Rinse (3)
Soak (2)
Acid (4)
(8)/(10)
(1)/(17)
(12)
(13)
(9)
(6)
Waste water
W11
f
f
W8
f f
Fresh water W7-11 W7
Wf W15f
Table 1
Specification for the case study (Xu and Huang, 2004).
Table 2
Loaded move information for the case study (Xu and Huang, 2004).
Index (i) A B C D E F J
7 J
8 I
Solution from
previous study
(Xu and Huang, 2004)
13.2
Electricity Usage (kWh)
13.15
13.1
13.05
Approximation of
Pareto frontier surface
42 507
40 506
38 505
Co Fresh 36 504
nsu
mp Water 503 (s )
tion 34 Time
(L/ 502 Cycle
min
)
Fig. 6. Overview of the identified solution distribution and Pareto frontier surface.
The selection of the most desirable solution needs to balance graph of Solution 8. Note that there is a five-second waiting
the three objectives of the total cycle time, the electricity time at Unit 11. The WRND of Solution 8 is shown in Fig. 8. It
usage, and the fresh water consumption. As the necessary shows the freshwater and the external wastewater sources are
economic data is not available from the published case study, a allocated to Units 11 and 7, respectively. Meanwhile, the effluent
middle point (e.g. Solution 8 in Table 3) from the Pareto frontier is of Unit 5 is totally reused by Unit 7; a part of the effluent of
selected for solution demonstration. Fig. 7 shows the time-way Unit 7 is reused by Unit 3. The final wastewater discharges from
210 C. Liu et al. / Chemical Engineering Science 68 (2012) 202–214
Table 3
Pareto frontier results for the case study.
Solution Cycle time Fresh water Electricity Chemical processing time (sec.) Rinsing time (sec.)
number (sec.) usage (L/min) consumption
(kWh)
T Wf E Soak Electro- Acid Electro- Unit 3 Unit 7 Unit 5 Unit 11
cleaning plating
a
Selected for extensive solution demonstration.
b
Solution from previous study (Xu and Huang, 2004).
505
2 17 sec
205 sec
16 sec
3
Time (sec)
45 sec
7
4 21 sec
48 sec 8
16 sec 5
21 sec
6
1 19 sec
0
9 8/10 11 5 4 7 3 6 2 12 13 14 15 16 1/17
Tank index
Job lifting Job releasing Loaded move Free move Waiting time
both Units 7 and 3. This WRND makes the fresh water consump- production rate of Solution 8 increases by 6%; the electricity usage
tion significantly reduced. Compared with the original solution decreases by 6%; meanwhile, the freshwater consumption
from Xu and Huang (2004) (see Solution 13 in Table 3), the decreases by 20%.
C. Liu et al. / Chemical Engineering Science 68 (2012) 202–214 211
Fig. 9 demonstrates the dynamic feasibility of the four rinse 3 and 5 have the drag-out operation ahead of the drag-in
units under Solution 8, where the shadow area represents the operation, which is the reason why the shadow area positions
rinse mode of a specific unit. It shows that the rinse quality in are different.
each unit satisfies the rinse standard at the time when the To compare the results between using orthogonal collocation
processing job is dragged out. Thus, the rinsing product quality methods and using rigorous simulation, the detailed information
is guaranteed from dynamic operation point of view. The four about four elements and their orthogonal collocation points are
subplots indicate the dynamic responses under different drag-in summarized in Table 4. Note that the starting time of the second
and drag-out time and the contaminant concentrations. Unit
5 has the longest processing time (the shadow area), while
Table 4
Unit 7 has the shortest one. Meanwhile, Units 7 and 11 have Orthogonal collocation on finite elements results for WRND.
the drag-in operation before drag-out during one cycle, and Units
Finite Starting Element Orthogonal collocation points
23.1 L/min
Unit Elements Time Length (mg/L)
W1,a 7 18 .9 L/min
(sec.) (sec.) 1 2 3 4
28.2 L/min
Unit 7 Unit 3
Unit 7 1 175 372 2113.4 2054.7 1877.2 1731.1
2 42 12 1693.6 1763.6 2002.7 2240.4
3 54 109 2309.4 2288.5 2219.8 2154.9
11.2 L/min 4 163 12 2136.9 2134.0 2125.0 2116.0
2906 2906
Rinse standard
Rinse standard
2113.5 2113.5
Conc. (mg/L)
Conc. (mg/L)
528.5 528.5
0 100 200 300 400 500 0 100 200 300 400 500
Time (sec.) Time (sec.)
2906 2906
2113.5 2113.5
Conc. (mg/L)
Conc. (mg/L)
Rinse standard
Drag out
Drag in Drag out
1321 1321
Rinse standard
Drag in
528.5 528.5
0 100 200 300 400 500 0 100 200 300 400 500
Time (sec.) Time (sec.)
4 Finite Elements
3 Collocation Points
Job Job
Idle Waiting Rinsing
Drag In Drag Out
Cycle Time
Fig. 10. Orthogonal collocation on finite elements method for rinse dynamics (Liu et al., 2011).
ap,2 ¼ tdins
p ð43Þ References
ap,3 ¼ tdine
p ð44Þ Abel, O., Marquardt, W., 2000. Scenario-integrated modeling and optimization of
dynamic systems. AIChE Journal 46, 803–823.
Allgor, R.J., Barton, P.I., 1999. Mixed-integer dynamic optimization I: Problem
ap,4 ¼ tdouts
p ð45Þ formulation. Computers and Chemical Engineering 23, 567–584.
Armstrong, R., Lei, L., Gu, S., 1994. A bounding scheme for deriving the minimal
Dap,1 ¼ TDt p d ð46Þ cycle time of a single-transporter N-stage process with time window con-
straints. European Journal of Operational Research 78, 130–140.
Bansal, V., Sakizlis, V., Ross, R., Perkins, J.D., Pistikopoulos, E.N., 2003. New
Dap,2 ¼ d ð47Þ algorithms for mixed-integer dynamic optimization. Computers and Chemical
Engineering 27, 647–668.
Dap,3 ¼ Dtp d ð48Þ Baptiste, P., Legeard, B., Varnier, C. (1992). Hoist Scheduling Problem: An Approach
Based on Constraints Logic Programming. In: Proceedings of the IEEE Con-
ference on Robotics and Automation, 2, 1139–1144.
Dap,4 ¼ d ð49Þ Busch, J., Oldenburg, J., Santos, M., Cruse, A., Marquardt, W., 2007. Dynamic
predictive scheduling of operational strategies for continuous processes using
With the above settings, Eq. (26) is discretized into four nonlinear mixed-logic dynamic optimization. Computers and Chemical Engineering 31,
equations as shown in Eq. (50) through (53). Here, Cp,m,n is the p-th 574–587.
rinse unit contaminant concentration on the n-th collocation point at Chachuat, B., Singer, A.B., Barton, P.I., 2005. Global mixed-integer dynamic
optimization. AIChE Journal 51, 2235–2253.
m-th finite element; Dap,m is the length of the m-th finite element of Chen, H., Chu, C., Proth, J. M. (1995). Cyclic hoist scheduling based on graph theory.
the p-th rinse unit; fl(tn) is the collocation coefficient that depends Proceedings of the 1995 INRIA/IEEE Symposium on Emerging Technologies
on the location of the collocation points (Cuthrell and Biegler, 1987; and Factory Automation, IEEE Computer Society Press, Los Alamitos, CA. 1,
451–459.
Rice and Do, 1995). Eq. (54) is used to force continuous dynamic CPLEX. (1995). Using the CPLEX callable library. CPLEX Optimization, Inc.: Incline
profiles between adjacent finite elements. Eq. (55) suggests the initial Village, NV.
and final contaminant concentrations at the inlet in one cycle should Cuthrell, J.E., Biegler, L.T., 1987. On the optimization of differential-algebraic
process systems. AIChE Journal 33, 1257–1270.
be the same because the rinse operation is cyclic.
Drud, A.S., 1994. CONOPTs A Large Scale GRG Code. ORSA Journal on Computing. 6,
in
! 207.
X
NC
_ ðtn ÞDa W in
p Cp W out
p C p,1,n
C p,1,l f l p,1 ¼ 0, p ¼ 1, . . ., NR, n ¼ 1, . . ., NC Duke, L.D., 1994. Hazardous Waste Minimization: Is It Taking Root in U.S.
l¼1
Vp Vp Industry? Waste Minimization in Metal Finishing Facilities of the San Fran-
ð50Þ cisco Bay Area, California. Waste Management 14, 49–59.
Durney, L.J., 1984. Electroplating Engineering Handbook. Springer, New York, NY.
in din
! Erol, P., Thöming, J., 2006. ECO-optimization of pre-treatment processes in metal
X
NC
_ ðtn ÞDa W in
p Cp Din
p Cp W out
p C p,2,n finishing. Computers and Chemical Engineering 30, 587–598.
C p,2,l f l p,2 þ ¼ 0, Feng, X., Bai, J., Wang, H., Zheng, X., 2008. Grass-roots design of regeneration
l¼1
Vp Vp Vp
recycling water networks. Computers & Chemical Engineering 32 (8),
p ¼ 1, . . ., NR, n ¼ 1, . . ., NC ð51Þ 1892–1907.
Feng, X., Bai, J., Zheng, X., 2007. On the use of graphical method to determine the
in
! targets of single-contaminant regeneration recycling water systems. Chemical
X
NC
_ ðtn ÞDa W in
p Cp W out
p C p,3,n Engineering Science 62 (8), 2127–2138.
C p,3,n f l p,3 ¼ 0, Finlayson, B., 1980. Nonlinear Analysis in Chemical Engineering. McGraw-Hill,
l¼1
V p Vp
New York.
p ¼ 1, . . ., NR, n ¼ 1, . . ., NC ð52Þ Flores-Tlacuahuac, A., Biegler, L.T., 2007. Simultaneous mixed-integer dynamic
optimization for integrated design and control. Computers and Chemical
in
! Engineering 31, 588–600.
X
NC
_ ðtn ÞDa W in
p Cp ðW out out
p þ Dp ÞC p,4,n GAMS. (1992). GAMS Development Corporation: Washington, DC.
C p,4,n f l p,4 ¼ 0,
Vp Vp Gao, X.D., Chen, B.Z., He, X.R., Qiu, T., Li, J.C., Wang, C.M., 2008. Multi-objective
l¼1 optimization for the periodic operation of the naphtha pyrolysis process using
p ¼ 1, . . ., NR, n ¼ 1, . . ., NC ð53Þ a new parallel hybrid algorithm combining NSGA-II with SQP. Computers &
Chemical Engineering 32, 2801–2811.
X
NC Gunaratnam, M., Alva-Argaez, A., Kokossis, A., Kim, J.-K., Smith, R., 2005. Auto-
C p,m,1 C p,m1,l fl ð1Þ ¼ 0, p ¼ 1, . . ., NR, m ¼ 2, . . ., NE ð54Þ mated design of total water systems. Industrial & Engineering Chemistry
Research 44, 588–599.
l¼1
Karuppiah, R., Grossmann, I.E., 2006. Global optimization for the synthesis of
integrated water systems in chemical processes. Computers & Chemical
X
NC
Engineering 30, 650–673.
C p,1,1 C p,NE,l fl ð1Þ ¼ 0, p ¼ 1, . . ., NR ð55Þ Kumar, P.R., 1994. Scheduling semiconductor manufacturing plants. IEEE Control
l¼1 System 14, 33–40.
Note that the discretized WRND MINLP model, where W in p , Kuntay, I., Xu, Q., Uygun, K., Huang, Y.L., 2006. Environmentally conscious hoist
W out
p , C in
p , and Cp,m,n are all variables. The discretized model is
scheduling for electroplating facilities. Chemical Engineering Communications
193, 273–293.
nonconvex, because the left hand sides of Eq. (50) through (53), Kushner, J.B., Kushner, A.S., 1994. Water and Waste Control for the Plating Shop,
out in
i.e., f ðW in
p ,W p ,C p ,C p,m,n Þ, are all nonconvex functions. This could 3rd Edn. Hanser Gardner Pub., Cincinnati, OH.
214 C. Liu et al. / Chemical Engineering Science 68 (2012) 202–214
Lei, L. Wang, T. J. (1989). A Proof: The cyclic hoist scheduling problem is NP- Subaı̈, C., Baptiste, P., Niel, E., 2006. Scheduling issues for environmentally
complete. Working paper 89-0016, Rutgers University. responsible manufacturing: The case of hoist scheduling in an electroplating
Lei, L., Wang, T.J., 1994. Determining optimal cyclic hoist schedules on a single- line. International Journal of Production Economics 99, 74–87.
hoist electroplating line. IIE Transaction 26, 25–33. Terrazas-Moreno, S., Flores-Tlacuahuac, A., Grossmann, I.E., 2007. Simultaneous
Lim, S.R., Park, D., Lee, D.S., Park, J.M., 2006. Economic evaluation of water network cyclic scheduling and optimal control of polymerization reactors. AIChE
system through the net present value method based on cost and benefits
Journal 53, 2301–2315.
estimations. Industrial & Engineering Chemistry Research 45, 7710–7718.
Villadsen, J., Michelsen, M., 1978. Solution of Differential Equations Models by
Lim, S.R., Park, D., Park, J.M., 2007. Synthesis of an economically friendly water
system by maximizing net present value. Industrial Engineering Chemistry Polynomial Approximation. Prentice-Hall, New York.
Research 46, 6936–6943. Viswanathan, J., Grossmann, I.E., 1990. A combined penalty function and outer-
Liu, C.W., Fu, J., Xu, Q., 2011. Simultaneous mixed-integer dynamic optimization approximation method for MINLP optimization. Computers and Chemical
for environmentally benign electroplating. Computers & Chemical Engineering Engineering. 14 (7), 769–782.
35 (11), 2411–2425. Xu, Q., Huang, Y.L., 2004. Graph-assisted cyclic hoist scheduling for environmen-
Load, J.R., Pouech, P., Gallerani, P., 1996. Process analysis for optimization & tally benign electroplating. Industrial & Engineering Chemistry Research 43
pollution prevention. Plating and Surface Finishing 83, 28–35. (26), 8307–8316.
Philips, L.W., Unger, P.S., 1976. Mathematical programming solution of a hoist Xu, Q. Liu, C. (2008). Simultaneous cyclic hoist scheduling and water-reuse
scheduling program. AIIE Transactions 8, 219–225. network design for environmentally benign electroplating. Proceedings of
Prata, A., Oldenburg, J., Kroll, A., Marquardt, W., 2008. Integrated scheduling and the 2008 International Conference on Foundation of Computer-Aided Process
dynamic optimization of grade transitions for a continuous polymerization
Operation (FOCAPO), 183–186.
reactor. Computers Chemical Engineering 32, 463–476.
Yang, Y.H., Lou, H.H., Huang, Y.L., 1999. Optimal design of a water reuse system in
Rice, R.G., Do, D.D., 1995. Applied Mathematics and Modeling for Chemical
Engineers. Wiley, New York (NY). an electroplating plan. Journal of Plating and Surface Finishing 86 (4), 80–84.
Rodosek, R. Wallace, M. G. (1998). A generic model and hybrid algorithm for hoist Yang, Y.H., Lou, H.H., Huang, Y.L., 2000. Synthesis of an optimal wastewater reuse
scheduling problems, Proceedings of the Fourth International Conference on network. International Journal of Waste Management. 20 (4), 311–319.
Principles and Practice of Constant Programming, 385–399. Zhou, Q., Lou, H.H., Huang, Y.L., 2001. Design of a switchable water allocation
Shapiro, G.W., Nuttle, H.W., 1988. Hoist scheduling for a PCB electroplating network based on process dynamics. Industrial and Engineering Chemistry
facility. IIE Transactions 20, 157–167. Research 40, 4866–4873.