• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

On scheduling cycle shops: classification, complexity and approximation

Middendorf, Martin, Timkovsky, Vadim G. 25 October 2018 (has links)
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.

Page generated in 0.1096 seconds