The single machine sequencing problem is considered in which each job has a release date, a processing time and a delivery time. The objective is to find a sequence of jobs which minimizes the time by which all jobs are delivered. A heuristic is presented which never deviates by more than 50% from the optimum.
No takes yet. Share an insight, caveat, or question.
Chris N. Potts (1980) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: