Job Scheduling Experiment #1
Part 1: One machine, n jobs.
The six jobs below are to be scheduled on a machine that runs for two
eight-hour shifts each day of a five day work week. The jobs are assigned
names (letters of the alphabet) in the order in which they arrive. The
number in blue is the number of hours needed for the job; the width of
the box corresponds to this time. The number in red is the due date for
the job. Your task is to schedule the jobs in a way that maximizes the
system performance. To schedule a job, drag it to the machine schedule.
Three performance measures will be computed below. Try the following:
- schedule in order of first come first serve
- schedule in order of due date
- experiment with different schedules until you find the one that minimizes
throughput time.
Back to Scheduling Experimental Station