Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets

Tatsushi Nishi; Naoki Shimamura

doi:10.1109/IEEM.2018.8607741

Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We address a data-based identification method of machine scheduling problems using timed Petri nets. A general machine scheduling model is represented by timed Petri nets with resource places. Given a set of machines and jobs, and their starting times and completion times of several machines, the objective is to find resource constraints of a given machine scheduling problem from input and output data. The problem is to find the connectivity of each resource place in the operational places. A mixed integer linear programming model is formulated to find an optimal connectivity of resource places to minimize the mean square error of the input and output data. An approximation algorithm is developed to apply larger instances. Numerical examples are provided to show the effectiveness of the proposed approximation algorithm.

Original language	English
Title of host publication	2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018
Publisher	IEEE Computer Society
Pages	1461-1465
Number of pages	5
ISBN (Electronic)	9781538667866
DOIs	https://doi.org/10.1109/IEEM.2018.8607741
Publication status	Published - Jan 9 2019
Externally published	Yes
Event	2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018 - Bangkok, Thailand Duration: Dec 16 2018 → Dec 19 2018

Publication series

Name	IEEE International Conference on Industrial Engineering and Engineering Management
Volume	2019-December
ISSN (Print)	2157-3611
ISSN (Electronic)	2157-362X

Conference

Conference	2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018
Country/Territory	Thailand
City	Bangkok
Period	12/16/18 → 12/19/18

Keywords

Petri nets
approximation algorithm
model identification
scheduling

ASJC Scopus subject areas

Business, Management and Accounting (miscellaneous)
Industrial and Manufacturing Engineering
Safety, Risk, Reliability and Quality

Access to Document

10.1109/IEEM.2018.8607741

Cite this

Nishi, T., & Shimamura, N. (2019). Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets. In 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018 (pp. 1461-1465). [8607741] (IEEE International Conference on Industrial Engineering and Engineering Management; Vol. 2019-December). IEEE Computer Society. https://doi.org/10.1109/IEEM.2018.8607741

Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets. / Nishi, Tatsushi; Shimamura, Naoki.
2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018. IEEE Computer Society, 2019. p. 1461-1465 8607741 (IEEE International Conference on Industrial Engineering and Engineering Management; Vol. 2019-December).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nishi, T & Shimamura, N 2019, Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets. in 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018., 8607741, IEEE International Conference on Industrial Engineering and Engineering Management, vol. 2019-December, IEEE Computer Society, pp. 1461-1465, 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018, Bangkok, Thailand, 12/16/18. https://doi.org/10.1109/IEEM.2018.8607741

Nishi T, Shimamura N. Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets. In 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018. IEEE Computer Society. 2019. p. 1461-1465. 8607741. (IEEE International Conference on Industrial Engineering and Engineering Management). doi: 10.1109/IEEM.2018.8607741

@inproceedings{17fdd3995ea14f26964e40dcf90f1eea,

title = "Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets",

abstract = "We address a data-based identification method of machine scheduling problems using timed Petri nets. A general machine scheduling model is represented by timed Petri nets with resource places. Given a set of machines and jobs, and their starting times and completion times of several machines, the objective is to find resource constraints of a given machine scheduling problem from input and output data. The problem is to find the connectivity of each resource place in the operational places. A mixed integer linear programming model is formulated to find an optimal connectivity of resource places to minimize the mean square error of the input and output data. An approximation algorithm is developed to apply larger instances. Numerical examples are provided to show the effectiveness of the proposed approximation algorithm.",

keywords = "Petri nets, approximation algorithm, model identification, scheduling",

author = "Tatsushi Nishi and Naoki Shimamura",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018 ; Conference date: 16-12-2018 Through 19-12-2018",

year = "2019",

month = jan,

day = "9",

doi = "10.1109/IEEM.2018.8607741",

language = "English",

series = "IEEE International Conference on Industrial Engineering and Engineering Management",

publisher = "IEEE Computer Society",

pages = "1461--1465",

booktitle = "2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018",

address = "United States",

}

TY - GEN

T1 - Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets

AU - Nishi, Tatsushi

AU - Shimamura, Naoki

PY - 2019/1/9

Y1 - 2019/1/9

N2 - We address a data-based identification method of machine scheduling problems using timed Petri nets. A general machine scheduling model is represented by timed Petri nets with resource places. Given a set of machines and jobs, and their starting times and completion times of several machines, the objective is to find resource constraints of a given machine scheduling problem from input and output data. The problem is to find the connectivity of each resource place in the operational places. A mixed integer linear programming model is formulated to find an optimal connectivity of resource places to minimize the mean square error of the input and output data. An approximation algorithm is developed to apply larger instances. Numerical examples are provided to show the effectiveness of the proposed approximation algorithm.

AB - We address a data-based identification method of machine scheduling problems using timed Petri nets. A general machine scheduling model is represented by timed Petri nets with resource places. Given a set of machines and jobs, and their starting times and completion times of several machines, the objective is to find resource constraints of a given machine scheduling problem from input and output data. The problem is to find the connectivity of each resource place in the operational places. A mixed integer linear programming model is formulated to find an optimal connectivity of resource places to minimize the mean square error of the input and output data. An approximation algorithm is developed to apply larger instances. Numerical examples are provided to show the effectiveness of the proposed approximation algorithm.

KW - Petri nets

KW - approximation algorithm

KW - model identification

KW - scheduling

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

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

U2 - 10.1109/IEEM.2018.8607741

DO - 10.1109/IEEM.2018.8607741

M3 - Conference contribution

AN - SCOPUS:85061793640

T3 - IEEE International Conference on Industrial Engineering and Engineering Management

SP - 1461

EP - 1465

BT - 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018

PB - IEEE Computer Society

T2 - 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018

Y2 - 16 December 2018 through 19 December 2018

ER -

Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this