Scheduling with alternative routings in CNC workshops

Youichi Nonaka, Gábor Erdos, T. Kis, Takahiro Nakano, J. Váncza

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

In workshops of CNC machines, jobs may have alternative sequences of operations, where each operation must be performed on one of a pre-specified subset of machines. The key to solving to this extremely hard scheduling problem is balancing the load on machines of a flexible job shop. The proposed method combines mathematical programming for selecting the best routing alternatives and tabu search for finding the best assignment of machines to operations along with the routings. Experiments in an industrial case study refer to the primary role of optimized load balancing that proved to be computationally tractable on large-scale problem instances.

Original languageEnglish
Pages (from-to)449-454
Number of pages6
JournalCIRP Annals - Manufacturing Technology
Volume61
Issue number1
DOIs
Publication statusPublished - 2012

Fingerprint

Tabu search
Mathematical programming
Resource allocation
Scheduling
Experiments

Keywords

  • Load balancing
  • Optimization
  • Scheduling

ASJC Scopus subject areas

  • Mechanical Engineering
  • Industrial and Manufacturing Engineering

Cite this

Scheduling with alternative routings in CNC workshops. / Nonaka, Youichi; Erdos, Gábor; Kis, T.; Nakano, Takahiro; Váncza, J.

In: CIRP Annals - Manufacturing Technology, Vol. 61, No. 1, 2012, p. 449-454.

Research output: Contribution to journalArticle

Nonaka, Youichi ; Erdos, Gábor ; Kis, T. ; Nakano, Takahiro ; Váncza, J. / Scheduling with alternative routings in CNC workshops. In: CIRP Annals - Manufacturing Technology. 2012 ; Vol. 61, No. 1. pp. 449-454.
@article{0fddbff7b3ee41cc99973689138e71d9,
title = "Scheduling with alternative routings in CNC workshops",
abstract = "In workshops of CNC machines, jobs may have alternative sequences of operations, where each operation must be performed on one of a pre-specified subset of machines. The key to solving to this extremely hard scheduling problem is balancing the load on machines of a flexible job shop. The proposed method combines mathematical programming for selecting the best routing alternatives and tabu search for finding the best assignment of machines to operations along with the routings. Experiments in an industrial case study refer to the primary role of optimized load balancing that proved to be computationally tractable on large-scale problem instances.",
keywords = "Load balancing, Optimization, Scheduling",
author = "Youichi Nonaka and G{\'a}bor Erdos and T. Kis and Takahiro Nakano and J. V{\'a}ncza",
year = "2012",
doi = "10.1016/j.cirp.2012.03.045",
language = "English",
volume = "61",
pages = "449--454",
journal = "CIRP Annals - Manufacturing Technology",
issn = "0007-8506",
publisher = "Elsevier USA",
number = "1",

}

TY - JOUR

T1 - Scheduling with alternative routings in CNC workshops

AU - Nonaka, Youichi

AU - Erdos, Gábor

AU - Kis, T.

AU - Nakano, Takahiro

AU - Váncza, J.

PY - 2012

Y1 - 2012

N2 - In workshops of CNC machines, jobs may have alternative sequences of operations, where each operation must be performed on one of a pre-specified subset of machines. The key to solving to this extremely hard scheduling problem is balancing the load on machines of a flexible job shop. The proposed method combines mathematical programming for selecting the best routing alternatives and tabu search for finding the best assignment of machines to operations along with the routings. Experiments in an industrial case study refer to the primary role of optimized load balancing that proved to be computationally tractable on large-scale problem instances.

AB - In workshops of CNC machines, jobs may have alternative sequences of operations, where each operation must be performed on one of a pre-specified subset of machines. The key to solving to this extremely hard scheduling problem is balancing the load on machines of a flexible job shop. The proposed method combines mathematical programming for selecting the best routing alternatives and tabu search for finding the best assignment of machines to operations along with the routings. Experiments in an industrial case study refer to the primary role of optimized load balancing that proved to be computationally tractable on large-scale problem instances.

KW - Load balancing

KW - Optimization

KW - Scheduling

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

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

U2 - 10.1016/j.cirp.2012.03.045

DO - 10.1016/j.cirp.2012.03.045

M3 - Article

AN - SCOPUS:84861609464

VL - 61

SP - 449

EP - 454

JO - CIRP Annals - Manufacturing Technology

JF - CIRP Annals - Manufacturing Technology

SN - 0007-8506

IS - 1

ER -