A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Vladimir Kats; Eugene Levner

doi:10.1016/s0167-6377(97)00036-9

A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Vladimir Kats
, Eugene Levner

Ben-Gurion University of the Negev
Holon Institute of Technology

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

42 Scopus citations

Abstract

We consider the problem of cyclic scheduling of identical jobs in a re-entrant flowshop. A robot is responsible for moving each job from a machine to another. Our aim is to find a minimum length cycle of the robot's moves such that exactly one new job enters the system and exactly one completed job leaves the system during the cycle. We present a strongly polynomial algorithm for finding such a cycle.

Original language	English
Pages (from-to)	171-179
Number of pages	9
Journal	Operations Research Letters
Volume	21
Issue number	4
DOIs	https://doi.org/10.1016/s0167-6377(97)00036-9
State	Published - Nov 1997
Externally published	Yes

Keywords

Cyclic scheduling
Optimization
Production/scheduling

Access to Document

10.1016/s0167-6377(97)00036-9

Cite this

@article{5eb7d51f2c4548e19860da9554a42a27,

title = "A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling",

abstract = "We consider the problem of cyclic scheduling of identical jobs in a re-entrant flowshop. A robot is responsible for moving each job from a machine to another. Our aim is to find a minimum length cycle of the robot's moves such that exactly one new job enters the system and exactly one completed job leaves the system during the cycle. We present a strongly polynomial algorithm for finding such a cycle.",

keywords = "Cyclic scheduling, Optimization, Production/scheduling",

author = "Vladimir Kats and Eugene Levner",

year = "1997",

month = nov,

doi = "10.1016/s0167-6377(97)00036-9",

language = "אנגלית",

volume = "21",

pages = "171--179",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

AU - Kats, Vladimir

AU - Levner, Eugene

PY - 1997/11

Y1 - 1997/11

N2 - We consider the problem of cyclic scheduling of identical jobs in a re-entrant flowshop. A robot is responsible for moving each job from a machine to another. Our aim is to find a minimum length cycle of the robot's moves such that exactly one new job enters the system and exactly one completed job leaves the system during the cycle. We present a strongly polynomial algorithm for finding such a cycle.

AB - We consider the problem of cyclic scheduling of identical jobs in a re-entrant flowshop. A robot is responsible for moving each job from a machine to another. Our aim is to find a minimum length cycle of the robot's moves such that exactly one new job enters the system and exactly one completed job leaves the system during the cycle. We present a strongly polynomial algorithm for finding such a cycle.

KW - Cyclic scheduling

KW - Optimization

KW - Production/scheduling

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

U2 - 10.1016/s0167-6377(97)00036-9

DO - 10.1016/s0167-6377(97)00036-9

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

AN - SCOPUS:0031269154

SN - 0167-6377

VL - 21

SP - 171

EP - 179

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this