Finite Forward Scheduling
Your company owns one lathe (M1), one milling machine (M2), and one drilling machine (M3). A working day lasts eight hours. As Figure 14.7.3.1 shows, eight products (P1, P2, P3, ..., P8) are manufactured on these machines. Each product loads these machines in a different sequence. For simplicity, assume that there is no interoperation time.
(COLUMN CANT COPY)
Perform finite forward scheduling for the next three days. The normal working time of 8 hours per day has to be respected, as do the sequence of the operations for each order given by Figure 14.7.3.1 and the following three priority rules:
1. No idle time on the machine
2. Operation with the shortest processing time
3. Longest remaining lead time for the order
The Gantt-type chart planning board in Figure 14.7.3.2 will help you to perform the task. Note the first orders on each machine. The order for product $\mathrm{P} 1$ has been chosen for machine Ml because of the third priority rule.
(COLUMNS CANT COPY)
Discuss whether other priority rules would result in a better solution with regard to work in process.