Unformatted text preview: subject to the common due date of 18. The processing times of the jobs are shown below. Find an optimal sequence of jobs. Specify the start and completion time of each job in the optimal schedule. #3) Consider the following jobs to be processed on a single machine with the goal of minimizing total earliness and tardiness. ( w j ’ and w j ’’ are the weights of earliness and tardiness, respectively.) Suppose these jobs have to be processed in the order of 1-2-3-4-5-6-7. Find the optimal completion times for these seven jobs. Jobs 1 2 3 4 5 p j 5 3 6 4 10...
View Full Document
- Spring '12
- Logic, English-language films, Mathematical analysis, single machine, total earliness