An efficient schedule approach for customer treatment

This paper considers the problem of customer treatment on a single machine. It is assumed that jobs can be classified into two groups each belonging to a different customer, say customers A and B. An approach based on the efficient schedule is proposed to solve the problem by providing a complete set of non-dominated schedules with respect to the maximum tardiness of jobs in A and that in B. This new approach for customer treatment is useful to the decision maker since he can easily select an optimal schedule, according to his preference for different trade-off levels, from the small set of efficient schedules. A numerical example is given to illustrate the proposed algorithm which has a time complexity of O, where is the processing time of job and is the due date range for jobs in .