- AutorIn
- Martin Middendorf
- Vadim G. Timkovsky
- Titel
- On scheduling cycle shops
- Untertitel
- classification, complexity and approximation
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:15-qucosa2-320267
- Quellenangabe
- Journal of Scheduling Verlag: Wiley
Erscheinungsjahr: 2002
Jahrgang: 5
Heft: 2
Seiten: 135-169
E-ISSN: 1099-1425 - Erstveröffentlichung
- 2002
- Abstract (EN)
- This paper considers problems of finding non‐periodic and periodic schedules in a cycle shop which is a special case of a job shop but an extension of a flow shop. The cycle shop means the machine environment where all jobs have to pass the machines over the same route like in a flow shop but some of the machines in the route can be met more than once. We propose a classification of cycle shops and show that recently studied reentrant flow shops, robotic flow shops, loop reentrant flow 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.
- Freie Schlagwörter (EN)
- Informatics, Applied computer science
- Klassifikation (DDC)
- 004
- Förder- / Projektangaben
- Version / Begutachtungsstatus
- publizierte Version / Verlagsversion
- URN Qucosa
- urn:nbn:de:bsz:15-qucosa2-320267
- Veröffentlichungsdatum Qucosa
- 25.10.2018
- Dokumenttyp
- Artikel
- Sprache des Dokumentes
- Englisch