Single Reference Grid Continuous Time Formulation for Batch Scheduling

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Standard

Single Reference Grid Continuous Time Formulation for Batch Scheduling. / Mostafaei, Hossein; Harjunkoski, Iiro.

julkaisussa: IFAC-PapersOnLine, Vuosikerta 52, Nro 1, 2019, s. 832-837.

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Harvard

APA

Vancouver

Author

Bibtex - Lataa

@article{694f773b0cd14c769019f5f50fcdec06,
title = "Single Reference Grid Continuous Time Formulation for Batch Scheduling",
abstract = "Short term scheduling of multipurpose batch processes has received growing attention over past decades. It concerns the optimal allocation of a set of limited resources to tasks over time in order to enhance the revenue of plants. This paper addresses the short term scheduling of batch processes through a continuous-time mixed integer linear programming (MILP) formulation based on the state-task network (STN) representation that allows to consider multiple intermediate due dates for market requirements. The proposed formulation can be classified as a slot-based approach that views the time horizon as a set of ordered blocks of unknown and variable lengths. Compared to previous similar approaches, it is simpler and leads to a smaller mathematical model without decoupling tasks from units. A few benchmark problems are used to illustrate the computational advantages of the proposed optimization approach.",
author = "Hossein Mostafaei and Iiro Harjunkoski",
year = "2019",
doi = "10.1016/j.ifacol.2019.06.165",
language = "English",
volume = "52",
pages = "832--837",
journal = "IFAC-PapersOnLine",
issn = "2405-8963",
publisher = "Elsevier Science Publishers BV",
number = "1",

}

RIS - Lataa

TY - JOUR

T1 - Single Reference Grid Continuous Time Formulation for Batch Scheduling

AU - Mostafaei, Hossein

AU - Harjunkoski, Iiro

PY - 2019

Y1 - 2019

N2 - Short term scheduling of multipurpose batch processes has received growing attention over past decades. It concerns the optimal allocation of a set of limited resources to tasks over time in order to enhance the revenue of plants. This paper addresses the short term scheduling of batch processes through a continuous-time mixed integer linear programming (MILP) formulation based on the state-task network (STN) representation that allows to consider multiple intermediate due dates for market requirements. The proposed formulation can be classified as a slot-based approach that views the time horizon as a set of ordered blocks of unknown and variable lengths. Compared to previous similar approaches, it is simpler and leads to a smaller mathematical model without decoupling tasks from units. A few benchmark problems are used to illustrate the computational advantages of the proposed optimization approach.

AB - Short term scheduling of multipurpose batch processes has received growing attention over past decades. It concerns the optimal allocation of a set of limited resources to tasks over time in order to enhance the revenue of plants. This paper addresses the short term scheduling of batch processes through a continuous-time mixed integer linear programming (MILP) formulation based on the state-task network (STN) representation that allows to consider multiple intermediate due dates for market requirements. The proposed formulation can be classified as a slot-based approach that views the time horizon as a set of ordered blocks of unknown and variable lengths. Compared to previous similar approaches, it is simpler and leads to a smaller mathematical model without decoupling tasks from units. A few benchmark problems are used to illustrate the computational advantages of the proposed optimization approach.

U2 - 10.1016/j.ifacol.2019.06.165

DO - 10.1016/j.ifacol.2019.06.165

M3 - Conference article

VL - 52

SP - 832

EP - 837

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8963

IS - 1

ER -

ID: 35397546