Optimal release times in single-stage manufacturing systems with blocking: Optimal control perspective

This paper concerns a due-date matching problem in a single-stage manufacturing system. Given a finite sequence of jobs and their service order, and given the delivery due date of each job, the problem is to choose the jobs release (arrival) times so as to match as closely as possible their completion times to the respective due dates. The system is modelled as a deterministic single-server FIFO queue with an output buffer for storing jobs whose service is completed prior to their due dates. The output buffer has a finite capacity; when it is full, the server is being blocked. Associated with each job there is a convex cost function penalizing its earliness as well as tardiness. The due-date matching problem is cast as an optimal control problem, whose objective is to minimize the sum of the above cost functions by the choice of the jobs arrival (release) times. Time-box upper-bound and lower-bound constraints are imposed on the jobs output (delivery) times. The optimal-control setting brings to bear on the development of fast and efficient algorithms having intuitive geometric appeal and potential for online implementation.