Homework_04

# Homework_04 - subject to the common due date of 18 The...

This preview shows page 1. Sign up to view the full content.

IOE 543 Homework #4 Due at the beginning of class Thursday, February 11, 2010 #1) Problem 3.10 (Hint: If there is a job that will not be tardy even when it is the last one in the schedule, then there exists an optimal solution that schedules that job last. Is there such a job here? You can employ this logic to fix the last three jobs of the schedule before you do any branch-and-bound at all, which will save some computational effort.): #2) Suppose we have five jobs to be processed on a single machine and our objective is to minimize total earliness and tardiness. All jobs are weighted equally and they are
This is the end of the preview. Sign up to access the rest of the document.

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

## This note was uploaded on 03/16/2012 for the course IEOR 466 taught by Professor Richard during the Spring '12 term at Columbia.

Ask a homework question - tutors are online