抽象的

Two Stage Flow Shop Scheduling Model with Job Block Criteria and Unavailability of Machines Using Branch& Bound Technique

Deepak Gupta, Payal Singla, Shashi Bala

Flow shop scheduling problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider two stage flow shop scheduling problem in which a job block for a group job and the interval of non-availability of machine has been taken with an objective to minimize the make span. This paper provides a branch and bound technique to find optimal or near optimal sequence. This approach is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule for two stage flowshop scheduling problems. The method is clarified with the help of numerical illustration.

免责声明: 此摘要通过人工智能工具翻译,尚未经过审核或验证

索引于

学术钥匙
研究圣经
引用因子
宇宙IF
参考搜索
哈姆达大学
世界科学期刊目录
学者指导
国际创新期刊影响因子(IIJIF)
国际组织研究所 (I2OR)
宇宙

查看更多