...
首页> 外文期刊>Pure and Applied Mathematika Sciences >ON ALTERNATE OPTIMAL SOLUTION PROCEDURE FOR SOLVING n×2 FLOW-SHOP PROBLEM WITH TRANSPORTATION TIME AND EQUIVALENT JOB-BLOCK
【24h】

ON ALTERNATE OPTIMAL SOLUTION PROCEDURE FOR SOLVING n×2 FLOW-SHOP PROBLEM WITH TRANSPORTATION TIME AND EQUIVALENT JOB-BLOCK

机译:带运输时间和等价作业块的n×2流量问题的替代最优解过程

获取原文
获取原文并翻译 | 示例

摘要

In the deterministic flow shop scheduling theory, there are several assumptions made to date to fit into the physical conditions of production scheduling problems in Industries. Under one of the assumptions it is assumed that there is no time required to switch over from one machine to a subsequent machine after completion of the operation at the previous machine in flow shop. But there are practical situations which may be observed in industries in the production processes when the machines operating the jobs in successive but distinct stages are set up in different locations so that the output of one machine becomes the input to a subsequent machine and before the job is operated on the subsequent machine it has to experience certain additional times such as loading time, unloading time and the time required to complete the distance between one point of a machine to the other point of a machine in the operation process.
机译:在确定性流水车间调度理论中,迄今为止有几种假设可以适应行业中生产调度问题的物理条件。在一种假设下,假设在流水车间中的前一台机器完成操作之后,没有时间从一台机器切换到下一台机器。但是,在某些实际情况下,可能会在行业中的生产过程中观察到,在不同位置设置了连续但不同的阶段来运行作业的机器,使得一台机器的输出成为下一台机器的输入,也就是作业之前的输入。在随后的机器上操作时,它必须经历某些附加时间,例如装载时间,卸载时间以及在操作过程中完成机器的一个点到机器的另一点之间的距离所需的时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号