Splitting versus setup trade-offs for scheduling to minimize weighted completion time.
Oper. Res. Lett.(2016)
摘要
We study scheduling problems when jobs can be split and a setup is required before processing each part, to minimize the weighted sum of completion times. Using a simple splitting strategy and a reduction to an orders scheduling problem we derive a 2-approximation algorithm for the case with uniform weights and setups, improving upon previous work. We extend this idea to the general identical machine case and conclude by designing a constant factor approximation algorithm when machines are unrelated.
更多查看译文
关键词
Scheduling,Split jobs,Weighted completion time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络