Using tabu search to solve the common due date early/tardy machine scheduling with variable processing time

摘要

This paper consider the problem of assigning a common due-date and sequencing in which the jobs have varable processing times. The common due-date assignment method is used, which all jobs are assigned a common flow allowance. The total objective function is based on earliness/tardiness penalites, additional penalties (due-detes and completion times penalties) and the deviation of processing times. The objective is to find the optimal common due-date, the obtimal seuence and optimal processing time to minimize the objective function. The tabu search algorithm for finding the nearoptimal schedule is proposed and the results of computational experiments are presented.