论文部分内容阅读
This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times. The objective functions are the minimizing of makespan and total weighted completion time.