Multi-objective parallel machine scheduling problems by considering controllable processing times
研究了并行机调度中加工时间可在上下限间调整的问题，建立了两个多目标数学模型，分别优化总制造成本与总加权延迟，以及加入最大完工时间作为第三个目标。
This study examines parallel machine scheduling problems with controllable processing times. The processing time of each job can be between lower and upper bounds, and a cost is associated with the processing of a job on a machine. The processing time of a job can be decreased, which may lower the cycle time, although doing so would incur additional costs. This study develops two multi-objective mathematical models, which consist of two and three inconsistent objective functions, respectively. The first model minimizes the total manufacturing cost (TMC) and the total weighted tardiness (TWT) simultaneously, while the second uses makespan (Cmax as an additional objective function typically improves TWT and worsens TMC.