Cyclic scheduling in robotic flowshops with bounded work-in-process levels

Ada Che; Vladimir Kats; Eugene Levner

doi:10.1002/nav.20435

Cyclic scheduling in robotic flowshops with bounded work-in-process levels

Ada Che, Vladimir Kats, Eugene Levner

School of Management

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

6 Scopus citations

Abstract

This study addresses cyclic scheduling in robotic flowshops with bounded work-in-process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2-cyclic robotic flowshop scheduling problems for various WIP levels.

Original language	English
Pages (from-to)	1-16
Number of pages	16
Journal	Naval Research Logistics
Volume	58
Issue number	1
DOIs	https://doi.org/10.1002/nav.20435
State	Published - Feb 2011

Keywords

complexity
multi-cyclic scheduling
no-wait
polynomial algorithms
robotic scheduling
work-in-process

Access to Document

10.1002/nav.20435

Cite this

@article{7b84a70f795d4e899d8179928ee9be95,

title = "Cyclic scheduling in robotic flowshops with bounded work-in-process levels",

abstract = "This study addresses cyclic scheduling in robotic flowshops with bounded work-in-process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2-cyclic robotic flowshop scheduling problems for various WIP levels.",

keywords = "complexity, multi-cyclic scheduling, no-wait, polynomial algorithms, robotic scheduling, work-in-process",

author = "Ada Che and Vladimir Kats and Eugene Levner",

year = "2011",

month = feb,

doi = "10.1002/nav.20435",

language = "英语",

volume = "58",

pages = "1--16",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley & Sons Inc.",

number = "1",

}

TY - JOUR

T1 - Cyclic scheduling in robotic flowshops with bounded work-in-process levels

AU - Che, Ada

AU - Kats, Vladimir

AU - Levner, Eugene

PY - 2011/2

Y1 - 2011/2

N2 - This study addresses cyclic scheduling in robotic flowshops with bounded work-in-process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2-cyclic robotic flowshop scheduling problems for various WIP levels.

AB - This study addresses cyclic scheduling in robotic flowshops with bounded work-in-process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2-cyclic robotic flowshop scheduling problems for various WIP levels.

KW - complexity

KW - multi-cyclic scheduling

KW - no-wait

KW - polynomial algorithms

KW - robotic scheduling

KW - work-in-process

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

U2 - 10.1002/nav.20435

DO - 10.1002/nav.20435

M3 - 文章

AN - SCOPUS:79251618852

SN - 0894-069X

VL - 58

SP - 1

EP - 16

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 1

ER -

Cyclic scheduling in robotic flowshops with bounded work-in-process levels

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this