Job scheduling and collision resolution of multi-bridge processing systems

Document Type

Conference Proceeding

Publication Date

6-1-2015

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.

Identifier

84941208816 (Scopus)

ISBN

[9781479980697]

Publication Title

Icnsc 2015 2015 IEEE 12th International Conference on Networking Sensing and Control

External Full Text Location

https://doi.org/10.1109/ICNSC.2015.7116026

First Page

151

Last Page

156

This document is currently not available here.

Share

COinS