On scheduling cycle shops: classification, complexity and approximation

✍ Scribed by Martin Middendorf; Vadim G. Timkovsky

• Book ID: 102397853
• Publisher: Springer US
• Year: 2002
• Tongue: English
• Weight: 354 KB
• Volume: 5
• Category: Article
• ISSN: 1094-6136
• DOI: 10.1002/jos.95

✦ Synopsis

This 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.