Encontrados 4 documentos, a visualizar página 1 de 1
Scope for industrial applications of production scheduling models and solution ...
Harjunkoski, Iiro; Maravelias, Christos T.; Bongers, Peter; Castro, Pedro; Engell, Sebastian; Grossmann, Ignacio E.; Hooker, John; Mendez, Carlos A.This paper gives a review on existing scheduling methodologies developed for process industries. Above all, the aim of the paper is to focus on the industrial aspects of scheduling and discuss the main characteristics, including strengths and weaknesses of the presented approaches. It is claimed that optimization tools of today can effectively support the plant level production. However there is still clear pot...
Resource-task network formulations for industrial demand side management of a s...
Castro, Pedro; Sun, Lige; Harjunkoski, IiroIn today’s energy markets, there is a growing effort toward the alignment of the industrial sector and the power grid for the sake of efficient energy distribution and consumption. In this paper, the resource-task network is used to provide a generic modeling framework for production scheduling under energy constraints. Three alternative process models for the energy-intensive melt shop of a steel plant are pro...
Rolling-horizon algorithm for scheduling under time-dependent utility pricing a...
Castro, Pedro; Harjunkoski, Iiro; Grossmann, Ignacio E.This work addresses the scheduling of continuous single-stage multiproduct plants with energy intensive processing tasks and time-dependent electricity cost and power supply. A new rolling horizon algorithm is proposed that consists of a planning model to predict the production levels and a continuous-time model for detailed scheduling. The results from a set of test problems from the literature show that the a...
Effective decomposition algorithm for multistage batch plant scheduling
Castro, Pedro; Harjunkoski, Iiro; Grossmann, Ignacio E.This paper presents a new algorithm for the scheduling of batch plants with a large number of orders and sequence-dependent changeovers. Such problems are either intractable or yield poor solutions with full-space approaches. We use decomposition on the entire set of orders and derive the complete schedule in several iterations. The key idea is to allow for partial rescheduling without altering the main decisio...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||