Performance of decomposition procedures for Job shop scheduling problems with bottleneck machines

Reha Uzsoy; Cheng-Shuo Wang 20f

首页> 外文期刊>International Journal of Production Research >Performance of decomposition procedures for Job shop scheduling problems with bottleneck machines

【24h】

Performance of decomposition procedures for Job shop scheduling problems with bottleneck machines

机译：瓶颈机器对Job shop调度问题的分解过程的执行

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

Decomposition procedures for job shop scheduling problems, such as the shifting bottleneck (SB) procedure, have shown promising results for a variety of shop environments. However, they have primarily been tested using problems where all machines are identical in terms of processing time distribution. Many practical scheduling problems involve bottleneck machines which become the focus of scheduling efforts, as suggested by the theory of constraints.

机译：用于作业车间调度问题的分解过程，例如转移瓶颈（SB）程序，已在各种车间环境中显示出令人鼓舞的结果。但是，它们主要是针对所有机器在处理时间分配方面都相同的问题进行了测试。正如约束理论所建议的那样，许多实际的调度问题都涉及瓶颈机器，而瓶颈机器已成为调度工作的重点。

著录项

来源
《International Journal of Production Research》 |2000年第6期|p.1271-1286|共16页
作者
Reha Uzsoy; Cheng-Shuo Wang 20f;
展开▼
作者单位

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类管理学;
关键词

相似文献

外文文献
中文文献
专利

1. A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems [J] . Yingni Zhai, Changjun Liu, Wei Chu, Journal of Industrial Engineering and Management . 2014,第5期

机译：基于多瓶颈机器的分解启发式方法求解大规模作业车间调度问题
2. Effective and efficient scheduling of dynamic job shops-Combining the shifting bottleneck procedure with variable neighbourhood search [J] . Bernd Scholz-Reiter, Torsten Hildebrandt, Yi Tan CIRP Annals . 2013,第1aCDaROM期

机译：动态作业车间的有效和高效调度-将转移瓶颈过程与可变邻域搜索相结合
3. An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective [J] . Braune R., Z?pfel G., Affenzeller M. European Journal of Operational Research . 2012,第1期

机译：针对总加权拖后度目标的作业车间转移瓶颈程序中单机子问题的精确方法
4. Hybrid Heuristic Shifting Bottleneck Procedure for Parallel-Machine Job-Shop Scheduling Using GPU [C] . Vilasagarapu Sundeep, Reddy Guddeti Ram Mohana International Conference on Communication Systems and Network Technologies . 2015

机译：使用GPU的并行机器作业车间调度的混合启发式转移瓶颈过程
5. Minimization of weighted tardiness in job shops using shifting bottleneck and tabu search procedures. [D] . Bongarala, Srinivasa Rao. 2000

机译：使用转移的瓶颈和禁忌搜索程序，最大限度地减少作业车间中的加权拖尾。
6. A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem [O] . Mehrdad Amirghasemi, Reza Zamani -1

机译：小型和大型邻里方案的协同组合用于开发解决车间调度问题的有效程序
7. A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems [O] . Yingni Zhai, Changjun Liu, Wei Chu, 2014

机译：基于多瓶颈机器的分解启发式算法，用于大规模作业车间调度问题
8. Shifting Bottleneck Procedure for Job Shop Scheduling [R] . Adams, J., Balas, E., Zawack, D. 1986

机译：改变作业车间调度的瓶颈程序

Performance of decomposition procedures for Job shop scheduling problems with bottleneck machines

摘要

著录项

相似文献

相关主题

期刊订阅