Capítulo de Libro
Autoría
C.A. Méndez
;
G.P. Henning
;
J. Cerdá
Fecha
2000
Editorial y Lugar de Edición
Elsevier
Libro
Computer-Aided Chemical Engineering, 8
(pp. 1045-1050)
Elsevier
Elsevier
ISBN
0-444-50520-2
Resumen
Información suministrada por el agente en
SIGEVA
This work presents a new MILP mathematical formulation for the resource-constrained short term scheduling of flowshop batch facilities with a known topology and limited supplies of discrete resources. The proposed MILP approach is based on a continuous time domain representation and accounts for sequence-dependent setups. Assignment and sequencing decisions are independently handled through separate sets of binary variables. In addition, a proper formulation of the sequencing constraints provid...
This work presents a new MILP mathematical formulation for the resource-constrained short term scheduling of flowshop batch facilities with a known topology and limited supplies of discrete resources. The proposed MILP approach is based on a continuous time domain representation and accounts for sequence-dependent setups. Assignment and sequencing decisions are independently handled through separate sets of binary variables. In addition, a proper formulation of the sequencing constraints provides a substantial saving in the number of sequencing variables and constraints. By postulating a pair of conditions for the simultaneous execution of processing tasks, rather simple resource constraints requiring a few extra binary variables are also derived. The proposed approach shows a remarkable computational efficiency when applied to industrial applications.
Ver más
Ver menos
Palabras Clave
SchedulingMILP model