Abstract
This paper considers a single machine scheduling with reducible processing times, and with ready and due times constraints. Every job is available for processing on the ready time when the job needs to finish all preceding operations, and cannot be processed before the ready time. Every job must be completed before or just on the due time and no tardy jobs are allowed. The processing time of each job should be determined as being within a given interval between the minimum and maximum times. The production cost for each job depends on the determined processing time and increases in proportion as the processing time decreases. Three heuristic algorithms are developed to determine the processing time, starting time and completion time for every job subject to ready and due times constraints so as to minimize approximately the sum of production cost and holding cost for earliness. Computational experiments are shown for the three algorithms.
