Polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

Konstantin Kogan, Eugene Levner

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

The n-job, two-machine, multi-robot flowshop scheduling problem is considered with the objective of minimizing makespan. Various transportation, setup and loading/unloading effects arising in a modem flexible manufacturing cell are modeled by a graph representation of the technological process. An algorithm of O(n2) complexity is derived to solve the problem to optimality.

Original languageEnglish
Pages (from-to)53-62
Number of pages10
JournalComputers and Operations Research
Volume25
Issue number1
DOIs
StatePublished - Jan 1998
Externally publishedYes

Fingerprint

Dive into the research topics of 'Polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots'. Together they form a unique fingerprint.

Cite this