This paper considers due-date assignments and sequencing of n jobs in a single- machine shop in which each job is given a constant waiting allowance. The objective is to find the optimal value of the waiting allowance and the optimal job sequence to minimize a cost function based on the waiting allowance and the job earliness and tardiness values. We formulate the problem as an LP and find the optimal solution via considering the LP dual problem and show that the optimal waiting allowance is independent of the job sequence.
ASJC Scopus subject areas
- Applied Mathematics