An algorithm for scheduling a no-wait robotic production system with multi-type parts

Ada Che, Pengyu Yan, Naiding Yang, Chengbin Chu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An exact algorithm is proposed to solve a scheduling problem of a robotic production system in which multi-type parts are processed and parts are not allowed to wait on the machines. Finding an optimal schedule in such a production system is equivalent to finding two types of correlative sequences: parts input sequence and robot moves sequence. We show that the entering times of parts are the decision variables of the problem. We formulate our problem using the notion of prohibited intervals and solve it by enumerating intervals for linear functions of the decision variables, which is accomplished with a branch and bound procedure. Computational results on randomly generated test instances indicate that the algorithm is effective.

Original languageEnglish
Title of host publication2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Pages6017-6020
Number of pages4
DOIs
StatePublished - 2007
Event2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007 - Shanghai, China
Duration: 21 Sep 200725 Sep 2007

Publication series

Name2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

Conference

Conference2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Country/TerritoryChina
CityShanghai
Period21/09/0725/09/07

Keywords

  • Branch and bound algorithm
  • Cyclic scheduling
  • Multi-type parts
  • No-wait
  • Robotic production system

Fingerprint

Dive into the research topics of 'An algorithm for scheduling a no-wait robotic production system with multi-type parts'. Together they form a unique fingerprint.

Cite this