A Novel Network-based Continuous-time Formulation for Process Scheduling
We present a novel network-based continuous-time formulation for process scheduling that addresses multiple limitations of existing approaches. Specifically, it handles non-simultaneous transfers of input/output materials to/from processing units; it employs a more flexible time representation; and...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2008 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/19786 |
| Acceso en línea: | http://hdl.handle.net/11336/19786 |
| Access Level: | acceso abierto |
| Palabra clave: | PROCESS SCHEDULING NETWORK-BASED CONTINUOUS-TIME FORMULATION https://purl.org/becyt/ford/2.2 https://purl.org/becyt/ford/2 |
| Sumario: | We present a novel network-based continuous-time formulation for process scheduling that addresses multiple limitations of existing approaches. Specifically, it handles non-simultaneous transfers of input/output materials to/from processing units; it employs a more flexible time representation; and it explicitly accounts for unit connectivity. This is accomplished via the modelling of two key issues: (i) the state of a processing/storage unit, and (ii) the material transfer between processing and storage units. The proposed formulation allows us to model many complexities associated with process scheduling and obtain solutions to problems that cannot be addressed by existing methods. |
|---|