Job Shop Scheduling with Due Dates and Variable Processing Times
CALIFORNIA UNIV LOS ANGELES WESTERN MANAGEMENT SCIENCE INST
Pagination or Media Count:
A multi-pass heuristic scheduling procedure developed for job shop scheduling problems with deterministic processing times is tested with processing times that are random variables. The heuristic procedure which uses expected processing times, typically generates a delay schedule i.e., a schedule in which some operations are delayed while the machine to process these operations is kept idle awaiting the arrival of another operation. Simulation is employed to compare the performance of the schedule generated by the heuristic procedure, a nondelay transformation of that schedule, and the nondelay schedules obtained with four single-pass dispatching rules.
- Operations Research
- Manufacturing and Industrial Engineering and Control of Production Systems