Integration of Max-plus-linear scheduling and control

Risvan Dirza; Alejandro Marquez Ruiz; Leyla Ozkan; Carlos Mendez Blanco

doi:10.1016/B978-0-12-818634-3.50214-9

Integration of Max-plus-linear scheduling and control

Risvan Dirza, Alejandro Marquez Ruiz (Corresponding author), Leyla Ozkan, Carlos Mendez Blanco

Research output: Contribution to journal › Conference article › peer-review

1 Citation (Scopus)

3 Downloads (Pure)

Abstract

In this paper, we investigate the Max-Plus-Linear (MPL) representation for the integration of scheduling and control problem. This is an attractive approach because the MPL representation can result in a convex scheduling problem. Using this representation, we have formulated the integration of scheduling and control problem considering the corresponding transitions time for each processing time. Furthermore, the MPL representation is combined with the sequential decomposition method (SDM) (Chu and You (2012)) in order to solve the integrated problem. The final result is a formulation that preserves the convexity of the original scheduling problem. Finally, the performance of the new formulation is tested on a simple case study and compared with the traditional method.

Original language	English
Pages (from-to)	1279-1284
Number of pages	6
Journal	Computer Aided Chemical Engineering
Volume	46
DOIs	https://doi.org/10.1016/B978-0-12-818634-3.50214-9
Publication status	Published - 25 Jul 2019
Event	29th European Symposium on Computer Aided Process Engineering (ESCAPE 29) - Evoluon, Eindhoven, Netherlands Duration: 16 Jun 2019 → 19 Jun 2019 Conference number: 29

Keywords

Control
Integration
Max-Plus-Linear Systems
Scheduling

Access to Document

10.1016/B978-0-12-818634-3.50214-9

Cite this

@article{c50d6d64d49043a2ab53d43c5f45e29d,

title = "Integration of Max-plus-linear scheduling and control",

abstract = "In this paper, we investigate the Max-Plus-Linear (MPL) representation for the integration of scheduling and control problem. This is an attractive approach because the MPL representation can result in a convex scheduling problem. Using this representation, we have formulated the integration of scheduling and control problem considering the corresponding transitions time for each processing time. Furthermore, the MPL representation is combined with the sequential decomposition method (SDM) (Chu and You (2012)) in order to solve the integrated problem. The final result is a formulation that preserves the convexity of the original scheduling problem. Finally, the performance of the new formulation is tested on a simple case study and compared with the traditional method.",

keywords = "Control, Integration, Max-Plus-Linear Systems, Scheduling",

author = "Risvan Dirza and {Marquez Ruiz}, Alejandro and Leyla Ozkan and {Mendez Blanco}, Carlos",

year = "2019",

month = jul,

day = "25",

doi = "10.1016/B978-0-12-818634-3.50214-9",

language = "English",

volume = "46",

pages = "1279--1284",

journal = "Computer Aided Chemical Engineering",

issn = "1570-7946",

publisher = "Elsevier",

note = "29th European Symposium on Computer Aided Process Engineering (ESCAPE 29), ESCAPE ; Conference date: 16-06-2019 Through 19-06-2019",

}

TY - JOUR

T1 - Integration of Max-plus-linear scheduling and control

AU - Dirza, Risvan

AU - Marquez Ruiz, Alejandro

AU - Ozkan, Leyla

AU - Mendez Blanco, Carlos

N1 - Conference code: 29

PY - 2019/7/25

Y1 - 2019/7/25

N2 - In this paper, we investigate the Max-Plus-Linear (MPL) representation for the integration of scheduling and control problem. This is an attractive approach because the MPL representation can result in a convex scheduling problem. Using this representation, we have formulated the integration of scheduling and control problem considering the corresponding transitions time for each processing time. Furthermore, the MPL representation is combined with the sequential decomposition method (SDM) (Chu and You (2012)) in order to solve the integrated problem. The final result is a formulation that preserves the convexity of the original scheduling problem. Finally, the performance of the new formulation is tested on a simple case study and compared with the traditional method.

AB - In this paper, we investigate the Max-Plus-Linear (MPL) representation for the integration of scheduling and control problem. This is an attractive approach because the MPL representation can result in a convex scheduling problem. Using this representation, we have formulated the integration of scheduling and control problem considering the corresponding transitions time for each processing time. Furthermore, the MPL representation is combined with the sequential decomposition method (SDM) (Chu and You (2012)) in order to solve the integrated problem. The final result is a formulation that preserves the convexity of the original scheduling problem. Finally, the performance of the new formulation is tested on a simple case study and compared with the traditional method.

KW - Control

KW - Integration

KW - Max-Plus-Linear Systems

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=85069687601&partnerID=8YFLogxK

U2 - 10.1016/B978-0-12-818634-3.50214-9

DO - 10.1016/B978-0-12-818634-3.50214-9

M3 - Conference article

AN - SCOPUS:85069687601

SN - 1570-7946

VL - 46

SP - 1279

EP - 1284

JO - Computer Aided Chemical Engineering

JF - Computer Aided Chemical Engineering

T2 - 29th European Symposium on Computer Aided Process Engineering (ESCAPE 29)

Y2 - 16 June 2019 through 19 June 2019

ER -

Integration of Max-plus-linear scheduling and control

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this