Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Vladimir Kats; Eugene Levner

doi:10.1007/s10951-010-0166-0

Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Vladimir Kats, Eugene Levner

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

14 Scopus citations

Abstract

Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and operation durations are chosen from prescribed intervals. A strongly polynomial algorithm of time complexity O(m ⁸log∈m) is proposed.

Original language	English
Pages (from-to)	267-279
Number of pages	13
Journal	Journal of Scheduling
Volume	14
Issue number	3
DOIs	https://doi.org/10.1007/s10951-010-0166-0
State	Published - Jun 2011
Externally published	Yes

Keywords

Binary search
Cyclic scheduling
Efficient algorithms
Graph-theoretic models
Polynomial models
Robotic scheduling

Access to Document

10.1007/s10951-010-0166-0

Cite this

@article{c8fcad32a9ec48d2bf075e2c81c9b447,

title = "Parametric algorithms for 2-cyclic robot scheduling with interval processing times",

abstract = "Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and operation durations are chosen from prescribed intervals. A strongly polynomial algorithm of time complexity O(m 8log∈m) is proposed.",

keywords = "Binary search, Cyclic scheduling, Efficient algorithms, Graph-theoretic models, Polynomial models, Robotic scheduling",

author = "Vladimir Kats and Eugene Levner",

year = "2011",

month = jun,

doi = "10.1007/s10951-010-0166-0",

language = "אנגלית",

volume = "14",

pages = "267--279",

journal = "Journal of Scheduling",

issn = "1094-6136",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Parametric algorithms for 2-cyclic robot scheduling with interval processing times

AU - Kats, Vladimir

AU - Levner, Eugene

PY - 2011/6

Y1 - 2011/6

N2 - Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and operation durations are chosen from prescribed intervals. A strongly polynomial algorithm of time complexity O(m 8log∈m) is proposed.

AB - Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and operation durations are chosen from prescribed intervals. A strongly polynomial algorithm of time complexity O(m 8log∈m) is proposed.

KW - Binary search

KW - Cyclic scheduling

KW - Efficient algorithms

KW - Graph-theoretic models

KW - Polynomial models

KW - Robotic scheduling

UR - http://www.scopus.com/inward/record.url?scp=79958090459&partnerID=8YFLogxK

U2 - 10.1007/s10951-010-0166-0

DO - 10.1007/s10951-010-0166-0

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

AN - SCOPUS:79958090459

SN - 1094-6136

VL - 14

SP - 267

EP - 279

JO - Journal of Scheduling

JF - Journal of Scheduling

IS - 3

ER -

Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this