Job shop scheduling differs fundamentally from flow shop by allowing each job unique routes through machines, eliminating the fixed sequence assumption. Gantt charts visualize machine utilization and completion times; dispatching rules (SPT: shortest processing time, EDD: earliest due date) make real-time scheduling decisions for queued jobs at each machine. Table of Contents: • Job shop problem definition: arbitrary job-machine visitation orders subject to precedence constraints • Machine capacity constraint: each machine processes one job at a time • Gantt chart representation: machines vs. time with job blocks showing utilization and idle periods • Dispatching rules framework: rule selection at decision points, tie-breaking protocols • SPT rule: prioritizes shorter jobs to reduce flow time and work-in-progress inventory • EDD rule: prioritizes by due date to minimize tardy jobs and maximum lateness • Performance measures: makespan, average completion time, maximum tardiness, machine utilization
Job shop scheduling differs fundamentally from flow shop by allowing each job unique routes through machines, eliminating the fixed sequence assumption. Gantt charts visualize machine utilization and…