Scheduling a two-machine robotic cell: A solvable case

Levner, Eugene; Kogan, Konstantin; Левин, И.

doi:10.1007/bf02099699

Cited by 29 publications

(12 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Levner et al (1995), a very similar problem is presented, using a different, more complex approach. It too can be simply solved by the above algorithm.…”

Section: Example 33mentioning

confidence: 97%

Transfer Lags in the Flow Shop

Emmons

Vairaktarakis

2012

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

We define the types of transfer lags, positive and negative, between stages of a flow shop, and discuss applications (transport times, nonbottleneck machines, manufacturing cells, batch transfers, setup and teardown times, master-slave systems, etc.). We show that the twomachine makespan problem is NP-hard, but that a variety of models can be efficiently solved using the Modified Johnson's Rule and its extensions when our search is restricted to permutation schedules. We extend the analysis to the two-stage hybrid shop, and then to the m machine shop, for which bounds and heuristics are given. Further results involving transfer lags are given in Chap. 4.

show abstract

“…In Levner et al (1995), a very similar problem is presented, using a different, more complex approach. It too can be simply solved by the above algorithm.…”

Section: Example 33mentioning

confidence: 97%

Transfer Lags in the Flow Shop

Emmons

Vairaktarakis

2012

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

show abstract

“…For what concerns batch B 6 , clearly it cannot be ensured that it reaches the steady state in any sequence of the batches in U, and therefore we must add b 6 …”

Section: An Examplementioning

confidence: 99%

“…The well-known Johnson's algorithm [4] allows to solve the problem when the flow shop consists of two machines, whereas for three or more machines the problem is strongly NP-hard [9]. On the other hand, the two-machine flow shop is the underlying architecture of several real-life flexible manufacturing cells (see, for instance, the Toyota cell analyzed in [5], or those proposed by [6], [2], and [10]). …”

Section: Introductionmentioning

confidence: 98%

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

Agnetis

Rossi

Gristina

1998

Naval Research Logistics

View full text Add to dashboard Cite

“…For completeness, we might mention three more groups of robotic (non-cyclic) scheduling problems which might be looked at as "atomic elements" of the cyclic problems: Robotic Non-cyclic Flowshop (Kise (1991), Levner et al (1995aLevner et al ( ,1995b, Kogan and Levner 1998), Robotic Non-cyclic Jobshop (Hurink and Knust (2002)), and Robotic Non-cyclic PERT-shop (Levner et al (1995c)). However, these problems lie out of the scope of the present survey.…”

Section: Pert-shop Modelsmentioning

confidence: 99%