arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.03552cs.DS
收藏

在线算法调度成批机器的比例柔性流水车间

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines

Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke

AI总结:

本文首次提出在线算法调度成批机器的比例柔性流水车间,提供两种算法并证明其竞争比,其中两阶段特殊情形达到黄金比例最优竞争比,结果同样适用于非柔性流水车间。

摘要:

本文首次考虑在线算法调度成批机器的比例柔性流水车间(PFFB)。该调度模型源于现代医学中用于治疗某些严重疾病的个性化药物的制造过程。我们提供了两种不同的在线算法,并证明了离线问题的下界以计算其竞争比。第一种算法是一种易于实现、通用的局部调度启发式算法。对于具有任意阶段数和若干自然调度目标的PFFB,该算法具有2竞争性。我们还表明,对于总/平均流时间,不存在具有更好竞争比的确定性算法。对于具有两个阶段且目标为最大完工时间或总完工时间的特殊情况,我们描述了一种改进算法,该算法实现了最佳可能的竞争比$\phi=\frac{1+\sqrt{5}}{2}$,即黄金比例。我们的所有结果也适用于成批机器的比例(非柔性)流水车间(PFB),对于该车间,这也是首次研究在线算法的论文。

英文摘要:

This paper is the first to consider online algorithms to schedule a proportionate flexible flow shop of batching machines (PFFB). The scheduling model is motivated by manufacturing processes of individualized medicaments, which are used in modern medicine to treat some serious illnesses. We provide two different online algorithms, proving also lower bounds for the offline problem to compute their competitive ratios. The first algorithm is an easy-to-implement, general local scheduling heuristic. It is 2-competitive for PFFBs with an arbitrary number of stages and for several natural scheduling objectives. We also show that for total/average flow time, no deterministic algorithm with better competitive ratio exists. For the special case with two stages and the makespan or total completion time objective, we describe an improved algorithm that achieves the best possible competitive ratio $φ=\frac{1+\sqrt{5}}{2}$, the golden ratio. All our results also hold for proportionate (non-flexible) flow shops of batching machines (PFB) for which this is also the first paper to study online algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑