Job scheduling and collision resolution of multi-bridge processing systems

Jun Li; Xianghu Meng; Mengchu Zhou

doi:10.1109/ICNSC.2015.7116026

Job scheduling and collision resolution of multi-bridge processing systems

Jun Li, Xianghu Meng, Mengchu Zhou

Electrical and Computer Engineering

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

5 Scopus citations

Abstract

A multi-bridge processing system (MBPS) has multiple bridge machines working at their serially arranged and partially overlapping workspaces. Its job scheduling can be abstracted as a colored travelling salesman problem (CTSP). CTSP is a new type of multiple traveling salesman problems in which each salesman must visit his exclusive cities and may visit some shared cities. This work presents a two-stage method for scheduling multi-bridge jobs first and resolve inter-bridge collision next. First, it proposes a population-based incremental learning (PBIL) algorithm to solve a serial-CTSP and the job scheduling problem of MBPS. PBIL processes two types of possibility vectors for city assignment/selection and a local search operation for improving its search ability. Second, this work designs a mechanism of collision resolution to remove potential inter-bridge collision contained in the obtained schedule. Finally, this work applies the proposed method to a triple-bridge waterjet cutting process to show its validity.

Original language	English (US)
Title of host publication	ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	151-156
Number of pages	6
ISBN (Electronic)	9781479980697
DOIs	https://doi.org/10.1109/ICNSC.2015.7116026
State	Published - Jan 1 2015
Event	2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 - Taipei, Taiwan, Province of China Duration: Apr 9 2015 → Apr 11 2015

Other

Other	2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015
Country/Territory	Taiwan, Province of China
City	Taipei
Period	4/9/15 → 4/11/15

All Science Journal Classification (ASJC) codes

Instrumentation
Control and Systems Engineering
Computer Networks and Communications

Access to Document

10.1109/ICNSC.2015.7116026

Cite this

@inproceedings{7b62e00f32d64477b7ffdbce1bf015d5,

title = "Job scheduling and collision resolution of multi-bridge processing systems",

abstract = "A multi-bridge processing system (MBPS) has multiple bridge machines working at their serially arranged and partially overlapping workspaces. Its job scheduling can be abstracted as a colored travelling salesman problem (CTSP). CTSP is a new type of multiple traveling salesman problems in which each salesman must visit his exclusive cities and may visit some shared cities. This work presents a two-stage method for scheduling multi-bridge jobs first and resolve inter-bridge collision next. First, it proposes a population-based incremental learning (PBIL) algorithm to solve a serial-CTSP and the job scheduling problem of MBPS. PBIL processes two types of possibility vectors for city assignment/selection and a local search operation for improving its search ability. Second, this work designs a mechanism of collision resolution to remove potential inter-bridge collision contained in the obtained schedule. Finally, this work applies the proposed method to a triple-bridge waterjet cutting process to show its validity.",

author = "Jun Li and Xianghu Meng and Mengchu Zhou",

year = "2015",

month = jan,

day = "1",

doi = "10.1109/ICNSC.2015.7116026",

language = "English (US)",

pages = "151--156",

booktitle = "ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 ; Conference date: 09-04-2015 Through 11-04-2015",

}

Li, J, Meng, X & Zhou, M 2015, Job scheduling and collision resolution of multi-bridge processing systems. in ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control., 7116026, Institute of Electrical and Electronics Engineers Inc., pp. 151-156, 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015, Taipei, Taiwan, Province of China, 4/9/15. https://doi.org/10.1109/ICNSC.2015.7116026

Job scheduling and collision resolution of multi-bridge processing systems. / Li, Jun; Meng, Xianghu; Zhou, Mengchu.
ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control. Institute of Electrical and Electronics Engineers Inc., 2015. p. 151-156 7116026.

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

TY - GEN

T1 - Job scheduling and collision resolution of multi-bridge processing systems

AU - Li, Jun

AU - Meng, Xianghu

AU - Zhou, Mengchu

PY - 2015/1/1

Y1 - 2015/1/1

N2 - A multi-bridge processing system (MBPS) has multiple bridge machines working at their serially arranged and partially overlapping workspaces. Its job scheduling can be abstracted as a colored travelling salesman problem (CTSP). CTSP is a new type of multiple traveling salesman problems in which each salesman must visit his exclusive cities and may visit some shared cities. This work presents a two-stage method for scheduling multi-bridge jobs first and resolve inter-bridge collision next. First, it proposes a population-based incremental learning (PBIL) algorithm to solve a serial-CTSP and the job scheduling problem of MBPS. PBIL processes two types of possibility vectors for city assignment/selection and a local search operation for improving its search ability. Second, this work designs a mechanism of collision resolution to remove potential inter-bridge collision contained in the obtained schedule. Finally, this work applies the proposed method to a triple-bridge waterjet cutting process to show its validity.

AB - A multi-bridge processing system (MBPS) has multiple bridge machines working at their serially arranged and partially overlapping workspaces. Its job scheduling can be abstracted as a colored travelling salesman problem (CTSP). CTSP is a new type of multiple traveling salesman problems in which each salesman must visit his exclusive cities and may visit some shared cities. This work presents a two-stage method for scheduling multi-bridge jobs first and resolve inter-bridge collision next. First, it proposes a population-based incremental learning (PBIL) algorithm to solve a serial-CTSP and the job scheduling problem of MBPS. PBIL processes two types of possibility vectors for city assignment/selection and a local search operation for improving its search ability. Second, this work designs a mechanism of collision resolution to remove potential inter-bridge collision contained in the obtained schedule. Finally, this work applies the proposed method to a triple-bridge waterjet cutting process to show its validity.

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

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

U2 - 10.1109/ICNSC.2015.7116026

DO - 10.1109/ICNSC.2015.7116026

M3 - Conference contribution

AN - SCOPUS:84941208816

SP - 151

EP - 156

BT - ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015

Y2 - 9 April 2015 through 11 April 2015

ER -

Job scheduling and collision resolution of multi-bridge processing systems

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this