A Bicriterion Scheduling Problem with Time/Cost Trade -offs

시간/비용의 트레이드-오프를 고려한 2목적 스케쥴링 문제

  • 정용식 (관동대학교 산업공학과)
  • Published : 1998.10.01

Abstract

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. 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 linear time/cost function.

Keywords