Mixed Integer Linear Programming in Process Scheduling: Modeling ...
Mixed Integer Linear Programming in Process Scheduling: Modeling ...
Mixed Integer Linear Programming in Process Scheduling: Modeling ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
156 FLOUDAS AND LIN<br />
νc ri ,νp ri , parameters, the amount of resource (r) consumed and produced per unit of the<br />
extent of task (i), respectively<br />
ξik cont<strong>in</strong>uous variable, the extent of all <strong>in</strong>stances of task (i) start<strong>in</strong>g at the beg<strong>in</strong>n<strong>in</strong>g of<br />
slot (k)<br />
ρ p<br />
is ,ρc is parameters, fractions of state (s) produced and consumed by task (i), respectively<br />
τ ji ′ i parameter, duration of the clean<strong>in</strong>g operation required for unit ( j) toswitch from<br />
task (i ′ )to(i)<br />
τk cont<strong>in</strong>uous variable, durations of time slot (k)<br />
Bijk cont<strong>in</strong>uous variable, amount of material which starts undergo<strong>in</strong>g task (i)<strong>in</strong>unit ( j)<br />
at event (k)<br />
Bijt cont<strong>in</strong>uous variable, amount of material which starts undergo<strong>in</strong>g task (i)<strong>in</strong>unit ( j)<br />
at time <strong>in</strong>terval (t)<br />
B(i, j, n) cont<strong>in</strong>uous variable, amount of material which starts undergo<strong>in</strong>g task (i) <strong>in</strong><br />
unit ( j)atevent po<strong>in</strong>t (n)<br />
Cs parameter, storage capacity limit for state (s)<br />
Dst cont<strong>in</strong>uous variable, amount of state (s) delivered at time <strong>in</strong>terval (t)<br />
dasn parameter, amount of the demand for state (s) atevent po<strong>in</strong>t (n)<br />
ddsn parameter, due date of the demand for state (s) atevent po<strong>in</strong>t (n)<br />
D(s, n) cont<strong>in</strong>uous variable, amounts of state (s) delivered at event po<strong>in</strong>t (n)<br />
H parameter, time Horizon<br />
i, i ′ <strong>in</strong>dices, tasks<br />
I set of all tasks<br />
I j set of tasks that can be performed <strong>in</strong> unit ( j)<br />
Ir set of tasks that consume or produce resource (r)<br />
I p<br />
s , I c s sets of tasks that produce and consume state (s), respectively<br />
j, j ′ <strong>in</strong>dex, units<br />
J set of all units<br />
Ji set of units suitable for task or order (i)<br />
k, k ′ , k ′′ <strong>in</strong>dices, events or time slots<br />
K set of events or time slots<br />
M parameter, a sufficiently large positive number