European Journal of Operational Research vol:11 issue:1 pages:48-54
This paper discusses a bieriterion approach to sequencing with time/cost trade-offs. This approach, which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single-machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by a linear time/cost function.