Tabu search approach for minimizing the makespan of the general job-shop

机译：禁忌搜索方法可最大程度地减少一般作业车间的工期

获取原文

获取原文并翻译 | 示例

页面导航

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

摘要

In this paper we propose an approximation approach for the problem of finding the minimum makespan in a general job-shop. The fundamental idea of this approach is based on the rescheduling activity of human scheduler. By viewing a Gantt chart of a non-optimal schedule, the human scheduler often finds a better schedule by changing its operation sequence within the predetermined precedence constraints.

机译：在本文中，我们提出了一种近似方法，用于在一般的车间中找到最小的制造期。这种方法的基本思想基于人工调度程序的重新调度活动。通过查看非最佳计划的甘特图，人类计划程序经常通过在预定优先级约束内更改其操作顺序来找到更好的计划。

著录项

来源
《ISIM'98 Proceedings of the Fourth China-Japan International Symposium on Industrial Management October 14-16, 1998, Dalian, China》|1998年|p.55-60|共6页
会议地点 Dalian(CN);Dalian(CN)
作者
Tsuyoshi Satake; Katsumi Morikawa; Katsuhiko Takahashi; Nobuto Nakamura;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类工业经济;
关键词

相似文献

外文文献
中文文献
专利

1. A local and global search combine particle swarm optimization algorithm for Job-shop scheduling to minimize makespan [J] . Lian Z. Discrete dynamics in nature and society . 2010,第Pta2期

机译：用于Job-shop调度的局部和全局搜索相结合的粒子群优化算法，以最大程度地缩短制造周期
2. A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan [J] . ZhigangLian Discrete dynamics in nature and society . 2010,第3期

机译：局部和全局搜索相结合的粒子群优化算法在车间调度中最小化制造周期
3. Application of Hybrid Firefly Algorithm-Tabu Search Technique to Minimize the Makespan in Job Shop Scheduling problem [J] . Manoj Govind Kharat, Siddhant Sanjeev Khadke, Rakesh D. Raut, International journal of applied industrial engineering . 2016,第2期

机译：混合萤火虫算法-Tabu搜索技术在最小化车间作业调度问题中的应用
4. Tabu search approach for minimizing the makespan of the general job-shop [C] . Tsuyoshi Satake, Katsumi Morikawa, Katsuhiko Takahashi, China-Japan international symposium on industrial management . 1998

机译：禁忌搜索方法，以最大限度地减少普通作业商店的MEPESPAN
5. Minimization of weighted tardiness in job shops using shifting bottleneck and tabu search procedures. [D] . Bongarala, Srinivasa Rao. 2000

机译：使用转移的瓶颈和禁忌搜索程序，最大限度地减少作业车间中的加权拖尾。
6. Hybrid Binary Imperialist Competition Algorithm and Tabu Search Approach for Feature Selection Using Gene Expression Data [O] . Shuaiqun Wang, Aorigele, Wei Kong, 2006

机译：基因表达数据的特征选择混合二元帝国主义竞争算法和禁忌搜索方法
7. Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations [O] . Yuri N. Sotskov, Natalja M. Matsveichuk, Vadzim D. Hatsura 2019

机译：双机工作店调度问题，以最大限度地减少不确定的工作持续时间的Makespan
8. Tabu Search Algorithms for Job-Shop Problems with a Single Transport Robot. [R] . Hurink, J. L., Knust, S. 2001

机译：Tabu搜索算法用于单个运输机器人的作业车间问题。

Tabu search approach for minimizing the makespan of the general job-shop

摘要

著录项

相似文献

相关主题

期刊订阅