WC consider the nonprccmptivc single machine scheduling problem with multiple due-dates (delivery dates). where the time between two consecutive due-dates is a constant. Given a set of jobs, we are interested in scheduling the jobs such that the sum of the total due-date cost and the total earliness cost is minimized with the constraint that each job must be finished at or before its due-date. ...

We have n jobs with release times and due-dates to be scheduled on a single-machine that can handle at most one job at a time. Our objective is to minimize the number of late jobs, ones completed after their due-dates. This problem is known to be solvable in time O(n4). We show that the special case of the problem when job processing times and due-dates are tied so that for each pair of jobs i,...

We present a novel model for due date quotation. Jobs arrive at a single server over time. Upon arrival, the processing time of each job is known, and due dates must be quoted for each job. The jobs must be sequenced on the server so that all jobs complete processing at or before their due dates, and the sum of quoted due dates is minimized. We develop several variations of an on-line heuristic...