A Novel Network-based Continuous-Time Representation for Process Scheduling: Part II. General Framework

In the first part of this series of paperswe presented a newnetwork-based continuous-time representation for the short-term scheduling of batch processes, which overcomes numerous shortcomings of existing approaches. In this second part, we discuss how this representation can be extended to address...

ver descrição completa

Detalhes bibliográficos
Autores: Gimenez, Diego Marcelo, Henning, Gabriela Patricia, Maravelias, Christos
Formato: artículo
Estado:Versión publicada
Fecha de publicación:2009
País:Argentina
Recursos:Consejo Nacional de Investigaciones Científicas y Técnicas
Repositorio:CONICET Digital (CONICET)
Idioma:inglés
OAI Identifier:oai:ri.conicet.gov.ar:11336/26090
Acesso em linha:http://hdl.handle.net/11336/26090
Access Level:acceso abierto
Palavra-chave:Process Scheduling
Network-Based Continuous-Time Representation
Mixed-Integer Linear Programming
https://purl.org/becyt/ford/2.4
https://purl.org/becyt/ford/2
Descrição
Resumo:In the first part of this series of paperswe presented a newnetwork-based continuous-time representation for the short-term scheduling of batch processes, which overcomes numerous shortcomings of existing approaches. In this second part, we discuss how this representation can be extended to address aspects such as: (i) preventive maintenance activities on unary resources (e.g., processing and storage units) that were planned ahead of time; (ii) resource-constrained changeover activities on processing and shared storage units; (iii) non-instantaneous resource-constrained material transfer activities; (iv) intermediate deliveries of raw materials and shipments of finished products at predefined times; and (v) scenarios where part of the schedule is fixed because it has been programmed in the previous scheduling horizon. The proposed integrated framework can be used to address a wide variety of process scheduling problems, many of which are intractable with existing tools.