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

Konstantin Kogan; Eugene Levner

doi:10.1016/s0305-0548(97)00033-6

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

Konstantin Kogan
, Eugene Levner

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

34 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(n²) complexity is derived to solve the problem to optimality.

Original language	English
Pages (from-to)	53-62
Number of pages	10
Journal	Computers and Operations Research
Volume	25
Issue number	1
DOIs	https://doi.org/10.1016/s0305-0548(97)00033-6
State	Published - Jan 1998
Externally published	Yes

Access to Document

10.1016/s0305-0548(97)00033-6

Cite this

@article{34b0e81d35b14779931eb48c3bb8c6b6,

title = "Polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots",

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.",

author = "Konstantin Kogan and Eugene Levner",

year = "1998",

month = jan,

doi = "10.1016/s0305-0548(97)00033-6",

language = "אנגלית",

volume = "25",

pages = "53--62",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "1",

}

TY - JOUR

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

AU - Kogan, Konstantin

AU - Levner, Eugene

PY - 1998/1

Y1 - 1998/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0031635632

U2 - 10.1016/s0305-0548(97)00033-6

DO - 10.1016/s0305-0548(97)00033-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0031635632

SN - 0305-0548

VL - 25

SP - 53

EP - 62

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 1

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this