Optimization of multistage cyclic service of a production line by a transmanipulator

Mikhalevich, V. S.; Beletskii, S. A.; Monastyrev, A. P.

doi:10.1007/bf01070591

Cited by 5 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An O(n log n) algorithm of Aneja and Kamoun [36] for RF2 B max is an improvement of an O(n 4 ) algorithm of Hall et al [32]. An O(m 3 log m) algorithm of Kats and Levner [39] for R1F|no wait; n = 1|P is the best result in a series of improvements of an algorithm of Kats and Mikhailetsky [52], which has been reviewed by Mikhalevich et al [53], Kats and Levner [17] and Levner et al [54]. A Nearest-Window-First (NWF) algorithm proposed by Degtiarev and Timkovsky [1] for an approximation of C|p ij = q i |C max solves C|n = 1; p ij = q i |P exactly [3; 4].…”

Section: Solvable In Polynomial Timementioning

confidence: 98%

On scheduling cycle shops: classification, complexity and approximation

Middendorf

Timkovsky

2002

J. Sched.

View full text Add to dashboard Cite

SUMMARYThis paper considers problems of ÿnding non-periodic and periodic schedules in a cycle shop which is a special case of a job shop but an extension of a ow shop. The cycle shop means the machine environment where all jobs have to pass the machines over the same route like in a ow shop but some of the machines in the route can be met more than once. We propose a classiÿcation of cycle shops and show that recently studied reentrant ow shops, robotic ow shops, loop reentrant ow shops and V shops are special cases of cycle shops. Problems solvable in polynomial time, pseudopolynomial time, NP-hard problems and performance guarantee approximations are presented. Related earlier results are surveyed.

show abstract

Section: Solvable In Polynomial Timementioning

confidence: 98%

On scheduling cycle shops: classification, complexity and approximation

Middendorf

Timkovsky

2002

J. Sched.

View full text Add to dashboard Cite

show abstract

“…They also suggest an algorithm for finding the optimal one-unit cycle, but do not estimate its running time. Mikhalevich et al [30] investigate that algorithm and show its time complexity to be O(m 5 ). Levner et al [27] use a network flow formulation to develop an O(m 3 ) time algorithm for the no-wait problem, RCCm|no-wait, k = 1, 1-unit|C t , again with an arbitrary distance matrix.…”

Section: Introductionmentioning

confidence: 99%

Untitled

Sriskandarajah¹,

Hall²,

Kamoun³

1998

Annals of Operations Research

View full text Add to dashboard Cite

A robotic cell is a manufacturing system that is widely used in industry. A robotic cell contains two or more robot-served machines, repetitively producing a family of similar parts, in a steady state. There are no buffers at or between the machines. Both the robot move cycle and the sequence of parts to produce are chosen in order to minimize the cycle time needed to produce a given set of parts. This objective is also equivalent to throughput rate maximization. In practice, simple robot move cycles that produce one unit are preferred by industry. In an m machine cell for m ≥ 2, there are m! such cycles that are potentially optimal. Choosing any one of these cycles reduces the cycle time minimization problem to a unique part sequencing problem. We prove the following results in an m machine cell, for any m ≥ 2. The part sequencing problems associated with these robot move cycles are classified into the following categories: (i) sequence independent; (ii) capable of formulation as a traveling salesman problem (TSP), but polynomially solvable; (iii) capable of formulation as a TSP and unary NP-hard; and (iv) unary NP-hard, but not having TSP structure. As a consequence of this classification, we prove that the part sequencing problems associated with exactly 2m -2 of the m! available robot cycles are polynomially solvable. The remaining cycles have associated part sequencing problems which are unary NP-hard.

show abstract

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

Kats¹,

Levner²

1997

Operations Research Letters

View full text Add to dashboard Cite

Optimization of multistage cyclic service of a production line by a transmanipulator

Cited by 5 publications

References 0 publications

On scheduling cycle shops: classification, complexity and approximation

On scheduling cycle shops: classification, complexity and approximation

Untitled

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

Contact Info

Product

Resources

About