Optimal scheduling of AGVs in a reentrant blocking job-shop

Publikation: Beiträge in ZeitschriftenKonferenzaufsätze in FachzeitschriftenForschungbegutachtet

Standard

Optimal scheduling of AGVs in a reentrant blocking job-shop. / Heger, Jens; Voß, Thomas.
in: Procedia CIRP, Jahrgang 67, 22.03.2018, S. 41-45.

Publikation: Beiträge in ZeitschriftenKonferenzaufsätze in FachzeitschriftenForschungbegutachtet

Harvard

APA

Vancouver

Heger J, Voß T. Optimal scheduling of AGVs in a reentrant blocking job-shop. Procedia CIRP. 2018 Mär 22;67:41-45. doi: 10.1016/j.procir.2017.12.173

Bibtex

@article{3c1b35c8234e49da9c563b0d77991a3a,
title = "Optimal scheduling of AGVs in a reentrant blocking job-shop",
abstract = "This work presents a mixed integer linear programming (MILP) formulation to find an optimal solution to a small instance of the complex scheduling problem in a make-to-order production. Minimizing the make span, the MILP generates the optimal schedule for the autonomous guided vehicles (AGVs) in a blocking reentrant job shop environment with different jobs. Feasible schedules for the machines and the AGVs are generated from different sized instances to evaluate the limits of the mathematical model. These results are compared to a priority rule based dispatching system, evaluated with a discrete event simulation. The comparison leads to the insight, that on the one hand optimal solutions cannot be calculated for most real world scenarios due to the complexity and on the other hand the application of a standard dispatching rule lead to poor performances neither of the technics are satisfying the need to generate an appropriate schedule. As a result possible solutions are presented.",
keywords = "Engineering, Milp, Blocking job shop, Agv, Make-to-order",
author = "Jens Heger and Thomas Vo{\ss}",
note = "Publisher Copyright: {\textcopyright} 2017 The Authors.; 11th Conference on Intelligent Computation in Manufacturing Engineering - CIRP ICME 2017 : Innovative and Cognitive Production Technology and Systems, CIRP ICME 2017 ; Conference date: 19-07-2017 Through 21-07-2017",
year = "2018",
month = mar,
day = "22",
doi = "10.1016/j.procir.2017.12.173",
language = "English",
volume = "67",
pages = "41--45",
journal = "Procedia CIRP",
issn = "2212-8271",
publisher = "Elsevier B.V.",
url = "http://www.icme.unina.it/ICME%2017/ICME_14.htm",

}

RIS

TY - JOUR

T1 - Optimal scheduling of AGVs in a reentrant blocking job-shop

AU - Heger, Jens

AU - Voß, Thomas

N1 - Conference code: 11

PY - 2018/3/22

Y1 - 2018/3/22

N2 - This work presents a mixed integer linear programming (MILP) formulation to find an optimal solution to a small instance of the complex scheduling problem in a make-to-order production. Minimizing the make span, the MILP generates the optimal schedule for the autonomous guided vehicles (AGVs) in a blocking reentrant job shop environment with different jobs. Feasible schedules for the machines and the AGVs are generated from different sized instances to evaluate the limits of the mathematical model. These results are compared to a priority rule based dispatching system, evaluated with a discrete event simulation. The comparison leads to the insight, that on the one hand optimal solutions cannot be calculated for most real world scenarios due to the complexity and on the other hand the application of a standard dispatching rule lead to poor performances neither of the technics are satisfying the need to generate an appropriate schedule. As a result possible solutions are presented.

AB - This work presents a mixed integer linear programming (MILP) formulation to find an optimal solution to a small instance of the complex scheduling problem in a make-to-order production. Minimizing the make span, the MILP generates the optimal schedule for the autonomous guided vehicles (AGVs) in a blocking reentrant job shop environment with different jobs. Feasible schedules for the machines and the AGVs are generated from different sized instances to evaluate the limits of the mathematical model. These results are compared to a priority rule based dispatching system, evaluated with a discrete event simulation. The comparison leads to the insight, that on the one hand optimal solutions cannot be calculated for most real world scenarios due to the complexity and on the other hand the application of a standard dispatching rule lead to poor performances neither of the technics are satisfying the need to generate an appropriate schedule. As a result possible solutions are presented.

KW - Engineering

KW - Milp

KW - Blocking job shop

KW - Agv

KW - Make-to-order

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

U2 - 10.1016/j.procir.2017.12.173

DO - 10.1016/j.procir.2017.12.173

M3 - Conference article in journal

VL - 67

SP - 41

EP - 45

JO - Procedia CIRP

JF - Procedia CIRP

SN - 2212-8271

T2 - 11th Conference on Intelligent Computation in Manufacturing Engineering - CIRP ICME 2017

Y2 - 19 July 2017 through 21 July 2017

ER -

Dokumente

DOI