Open shop

from Wikipedia, the free encyclopedia

In machine utilization planning , an open shop is a class of models for which orders are to be produced. An order consists of operations that have to be processed on the machines. The order of the orders can be freely selected, as well as the sequence of the individual work steps and thus also the machine sequence. They are models of production systems with a flexible manufacturing system .

If the sequence of operations is specified for each order, it is a job shop that models workshop production . If the work sequence is also identical for each order, it is a flow shop that represents a model of flow production . If there is only one machine, a one-machine problem arises . If the orders consist of only one work step that has to be processed on one of several machines, there is a machine occupancy problem with parallel machines .

In contrast to the Job Shop and Flow Shop problems, which have been extensively studied since the late 1950s, the more complex Open Shop problems have only been studied since the early 1980s. Most models are NP-hard . Gonzalez and Sahni examined the general two-machine case back in the mid-1970s and found an algorithm that leads to an optimal result in computing steps.

See also

literature

  • Domschke, Scholl, Voß: Production planning: procedural organizational aspects . 2nd edition, Springer, 1997.

Individual evidence

  1. T. Gonzales, S. Sahni: Open shop scheduling to minimize finish time. Journal of the ACM 23, 1976, pp. 665-679.