Content deleted Content added
404 Reference |
short description |
||
Line 1:
{{citation style|date=May 2016}}
{{short description|class of computational problem}}
'''Flow shop scheduling''' problems, are a class of [[Scheduling (production processes)|scheduling]] problems with a [[workshop]] or [[group shop]] in which the flow control shall enable an appropriate sequencing for each job and for processing on a set of [[machine]]s or with other [[resource]]s ''1,2,...,m'' in compliance with given processing orders. Especially the maintaining of a continuous flow of processing tasks is desired with a minimum of ''idle time'' and a minimum of ''waiting time''. Flow shop scheduling is a special case of [[job shop scheduling]] where there is strict order of all operations to be performed on all jobs. Flow shop scheduling may apply as well to [[Manufacturing|production]] facilities as to [[computing]] designs.
| |||