Job shop

from Wikipedia, the free encyclopedia

In machine occupancy planning , a job shop is a class of models in which n orders are to be produced on m machines . An order consists of a sequence of g operations that have to be processed on certain machines. In principle, each order can be processed several times on the same machine or some machines can be omitted. They are therefore models of production systems with workshop production . If the sequence of operations is identical for each order, it is a flow shop , which is a model of flow production . If the same sequence of jobs is processed on every machine, it is a permutation job shop. In the event that there is only one machine, a one-machine problem arises ; if the orders consist of only one operation that is to be processed on any machine, then there is a machine occupancy problem with parallel machines .

literature

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

See also

Individual evidence