Dynamic Algorithms for Input-Output Planning of Work-Station Loading

Abstract

The central problem in manufacturing planning is to reconcile due dates with schedule dates. Conventional (static) scheduling methods utilize expected process times, constant work station capacities, and technological sequencing to develop schedule dates, which rarely match planned due dates. A different approach, input-output control, is based upon throughput times (wait plus process), variable work station capacity, and lead times (from input to output) to try to match scheduled output dates with due dates. This paper presents several dynamic programming and transportation-type algorithms for determining optimal output level profiles under restrictions of permissible work station capacity levels and wait queue sizes.