Scheduling a two-machine robotic cell: A solvable case

Eugene Levner; Konstantin Kogan; Ilya Levin

doi:10.1007/bf02099699

Scheduling a two-machine robotic cell: A solvable case

Eugene Levner, Konstantin Kogan, Ilya Levin

Tel Aviv University

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

25 Scopus citations

Abstract

The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operations n, an optimal O(n log n)-time algorithm is proposed together with the proof of optimality.

Original language	English
Pages (from-to)	217-232
Number of pages	16
Journal	Annals of Operations Research
Volume	57
Issue number	1
DOIs	https://doi.org/10.1007/bf02099699
State	Published - Dec 1995
Externally published	Yes

Keywords

Scheduling
optimization
robotic cell
tandem machines

Access to Document

10.1007/bf02099699

Cite this

@article{fa033f2353764ec7bb1568b27a6f2a50,

title = "Scheduling a two-machine robotic cell: A solvable case",

abstract = "The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operations n, an optimal O(n log n)-time algorithm is proposed together with the proof of optimality.",

keywords = "Scheduling, optimization, robotic cell, tandem machines",

author = "Eugene Levner and Konstantin Kogan and Ilya Levin",

year = "1995",

month = dec,

doi = "10.1007/bf02099699",

language = "אנגלית",

volume = "57",

pages = "217--232",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Scheduling a two-machine robotic cell

T2 - A solvable case

AU - Levner, Eugene

AU - Kogan, Konstantin

AU - Levin, Ilya

PY - 1995/12

Y1 - 1995/12

N2 - The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operations n, an optimal O(n log n)-time algorithm is proposed together with the proof of optimality.

AB - The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operations n, an optimal O(n log n)-time algorithm is proposed together with the proof of optimality.

KW - Scheduling

KW - optimization

KW - robotic cell

KW - tandem machines

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

U2 - 10.1007/bf02099699

DO - 10.1007/bf02099699

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

AN - SCOPUS:21844487580

SN - 0254-5330

VL - 57

SP - 217

EP - 232

JO - Annals of Operations Research

JF - Annals of Operations Research

IS - 1

ER -

Scheduling a two-machine robotic cell: A solvable case

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this