Improving the time resolution of schedules generated via Lagrangian relaxation algorithms

A method is presented which enables relaxation algorithms to efficiently consider fractional utilization of larger time blocks, and thus quickly resolve the schedule into increments that match the precision of the known processing times. Although demonstrated here to be effective on the complicated job shop scheduling problem, the method can easily be extended to other manufacturing environments