Scheduling and Sequencing
Scheduling and Sequencing
Scheduling and Sequencing
Exercises
1. Use the assignment method to obtain a plan that will minimize the processing costs in the
following table under these conditions:
a. The combination 2-D is undesirable.
b. The combinations 1-A and 2-D are undesirable.
3. The production manager must determine the processing sequence for seven jobs
through the grinding and deburring departments. The same sequence will be followed in both
departments. The manager’s goal is to move the jobs through the two departments as quickly
as possible. The foreman of the deburring department wants the SPT rule to be used to
minimize the work-in-process inventory in his department
a. Prepare a schedule using FCFS and SPT for the grinding department.
b. What is the flow time in the grinding department for the FCFS and SPT sequence? What is
the total time needed to process the seven jobs in both the grinding and deburring departments?
c. Determine a sequence that will minimize the total time needed to process the jobs in both
departments. What flow time will result for the grinding department?
d. Discuss the trade-offs between the alternative sequencing arrangements. At what point
would the production manager be indifferent concerning the choice of sequences?
4. How should you assign the contracts to the trucks?
(100.000VND)
Truck Con. 1 Con. 2 Con. 3 Con. 4 Con. 5
A 7 6 8 9 8
B 10 8 9 6 7
C 8 10 9 8 10
D 9 9 10 8 9
E 8 7 6 7 6
a. To maximize the profit.
b. Assign the contracts to the trucks so that profit for each truck must be >700.000 VND
c. If there is a new contract with the profit (10, 9, 8, 11, 10) (100.000VND), will your
answer (a) change?
5. Find out the optimum sequence for processing the jobs.