A Procedure for Job Shop Scheduling with Due Dates, Variable Processing Times, and a Dynamic Arrival Process

An iterative machine procedure is described for job shop scheduling with due dates. The procedure uses a multi-pass heuristic scheduling program originally developed for static problems with deterministic processing times. Examples are included to demonstrate the applicability of the iterative procedure to static and dynamic problems with deterministic or statistical processing times, The concluding section of the paper is a discussion focusing upon the planned extension of the procedure to an interactive mode.