arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.07303math.OCcond-mat.dis-nnmath-phmath.MP
收藏

Flowshop调度问题中最大完工时间的普适性

Universality of Makespan in Flowshop Scheduling Problem

Takashi Shinzato, Kei Kobayashi, Ikou Kaku

摘要:

最大运行时间(Makespan)定义为一系列工件或任务的开始时间和结束时间之间的时间差,即通过带式输送机系统的时间,是调度问题中最重要的准则之一。它经常被制造企业在实践中使用,以提高作业处理顺序的操作效率。众所周知,即使作业处理顺序是固定的,机器的性能也取决于作业处理的特定定时。也就是说,一个系统在流水作业处理方面的性能取决于调度的过程。在本工作中,我们首先通过一个小的例子详细讨论了最大完工时间和几个调度过程之间的关系,并提供了一个算法来推导最大完工时间。使用我们提出的算法,几个数值实验进行检查,以揭示之间的关系的典型行为的最大完工时间和基准机的位置,相对于几个不同的分布的处理时间。我们还讨论了最大完工时间的行为,通过使用的形状函数的性质,在渗流理论的背景下使用。我们的贡献是首先详细讨论了流水车间问题中最大完工时间的普遍性,并得到了几个新的最大完工时间的性质,如下:(1)在几乎不受加工时间的概率分布的变化的影响的意义上,最大完工时间具有普适性,(2)最大完工时间可以分解为两个形状函数的和,调度规则对完工时间的影响小于调度过程对完工时间的影响。

英文摘要:

Makespan, which is defined as the time difference between the starting time and the terminate time of a sequence of jobs or tasks, as the time to traverse a belt conveyor system, is well known as one of the most important criteria in scheduling problems. It is often used by manufacturing firms in practice in order to improve the operational efficiency with respect to the order of job processing to be performed. It is known that the performance of a machine depends on the particular timing of the job processing even if the job processing order is fixed. That is, the performance of a system with respect to flowshop processing depends on the procedure of scheduling. In this present work, we first discuss the relationship between makespan and several scheduling procedures in detail by using a small example and provide an algorithm for deriving the makespan. Using our proposed algorithm, several numerical experiments are examined so as to reveal the relationship between the typical behavior of makespan and the position of the fiducial machine, with respect to several distinguished distributions of the processing time. We also discuss the behavior of makespan by using the properties of the shape functions used in the context of percolation theory. Our contributions are firstly giving a detail discussion on the universality of makespan in flowshop problems and obtaining several novel properties of makespan, as follows: (1) makespan possesses universality in the sense of being little affected by a change in the probability distribution of the processing time, (2) makespan can be decomposed into the sum of two shape functions, and (3) makespan is less affected by the dispatching rule than by the scheduling procedure.

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

↑