Download Now Free registration required
The flowshop sequencing problem is considered as one of the general production scheduling problem in which n different jobs must be processed by m machines in the same order. Complete enumeration, integer programming, branch and bound techniques can be used to find the optimal sequences for small size problems but they do not provide efficient solutions for large size problems. The problem of scheduling of n jobs on two machines arranged in tandem where time required transporting jobs from first machine to another machine was assumed to be negligible. There are practical scheduling situations when certain times are required by jobs for their transportation from one machine to another machine.
- Format: PDF
- Size: 305.71 KB