Job-Shop-Scheduling-Problem.md

JOB-SHOP-SCHEDULING-PROBLEM

AIMA3e

Jobs({AddEngine1 ≺ AddWheels1 ≺ Inspect1 },
 {AddEngine2 ≺ AddWheels2 ≺ Inspect2 })
Resources(EngineHoists(1), WheelStations(1), Inspectors(2), LugNuts(500))
Action(AddEngine1, DURATION: 30,
 USE: EngineHoists(1))
Action(AddEngine2, DURATION: 60,
 USE: EngineHoists(1))
Action(AddWheels1, DURATION: 30,
 CONSUME: LugNuts(20), USE: WheelStations(1))
Action(AddWheels2, DURATION: 15,
 CONSUME: LugNuts(20), USE: WheelStations(1))
Action(Inspect_i, DURATION: 10,
 USE: Inspectors(1))

---

Figure ?? A job-shop scheduling problem for assembling two cars, with resource constraints. The notation A ≺ B means that action A must precede action B.