Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times

Dvir Shabtay; Kfir Arviv

首页> 外文期刊>Applied Mathematical Modelling >Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times

【24h】

Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times

机译：最佳的机器人调度，以在与工作无关的处理时间的三机流水车间环境中最小化制造周期

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We study a robotic three-machine flow-shop scheduling problem, in which n identical jobs are to be processed and the objective is to minimize the makespan. After the job's completion on either the first or the second machine it is transferred by a robot to the next (consecutive) machine in the shop. A single robot is available for transferring the jobs. We show that the problem can be solved by decomposing it into a set of sub-problems, and by providing a robot schedule to each sub-problem that yields a makespan value which matches the lower bound value.

机译：我们研究了一个机器人的三机流水车间调度问题，其中要处理n个相同的作业，目标是最大程度地缩短工期。在第一台或第二台机器上完成作业后，它将由机器人将其转移到车间中的下一台（连续）机器上。单个机器人可用于传输作业。我们表明，可以通过将问题分解为一系列子问题并为每个子问题提供机器人计划表来解决该问题，该计划会产生与下界值匹配的makepan值。

著录项

来源
《Applied Mathematical Modelling》 |2016年第6期|4231-4247|共17页
作者
Dvir Shabtay; Kfir Arviv;
展开▼
作者单位

Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;

Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
Scheduling; Flow-shop; Identical jobs; Makespan; Transportation times; Robot;

机译：排程;流水车间;相同的工作;Makespan;运输时间;机器人;

相似文献

外文文献
中文文献
专利

1. Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan [J] . Asiye Aydilek, Harun Aydilek, Ali Allahverdi International Journal of Production Research . 2015,第9a10期

机译：在两台机器的流水车间调度环境中进行生产，不确定的处理和设置时间可最大程度地缩短制造时间
2. Makespan minimization for flow-shop problems with transportation times and a single robot [J] . Johann Hurink, Sigrid Knust Discrete Applied Mathematics . 2001,第1a3期

机译：通过运输时间和单个机器人来最大程度地减少流程车间的问题
3. Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect [J] . Win-Chin Lin Discrete dynamics in nature and society . 2018,第4期

机译：具有基于处理时间的学习效果的两阶段三机装配流水车间问题的制造周期最小化
4. Scheduling to Minimize Makespan with Time-Dependent Processing Times [C] . L.Y. Kang, T.C.E. Cheng, C.T. Ng, International Symposium on Algorithms and Computation(ISAAC 2005); 20051219-21; Sanya(CN) . 2005

机译：调度以使时间依赖于处理时间以最小化制造时间
5. Unrelated parallel machine scheduling with sequence-dependent setup times and machine eligibility restrictions for minimizing the makespan. [D] . Salem, Ameer Hassan. 1999

机译：无关的并行机器调度，具有与序列有关的设置时间和机器合格限制，可最大程度地缩短制造周期。
6. Heuristic algorithms for the minmax regret flow-shop problem with interval processing times [O] . Michał Ćwik, Jerzy Józefczyk -1

机译：minmax的启发式算法使处理时间间隔为间隔的流水车间问题后悔
7. TWO- AND THREE- MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING, TIMES [O] . Shunichi Abe 1985

机译：两种和三机器流店Mapespan调度问题与处理中的额外时间分开，时间
8. Optimal Multiprocessor Scheduling of Periodic Tasks in a Real-Time Environment [R] . Seward, W. D. 1979

机译：实时环境中周期任务的最优多处理机调度

Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times

摘要

著录项

相似文献

相关主题

期刊订阅