首页> 外文期刊>Computers & operations research >Flow shop scheduling problem with position-dependent processing times
【24h】

Flow shop scheduling problem with position-dependent processing times

机译:具有与位置相关的处理时间的流水车间调度问题

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

摘要

This study addresses a flow shop sequencing problem with position-dependent processing times. The aim of this work is to minimize the maximum tardiness and analyze the effects of the deterioration factor. This work is different from existing works in the literature, in that processing times are not per se deteriorating; instead, the resources deteriorate. This model allows the analysis of worker fatigue in a hand intensive manufacturing system, such as in the luxury or textile industries. A case study of the problem is presented. In addition, a mathematical model, one sequencing heuristic, two improvement heuristics, and two metaheuristics are proposed, i.e., iterated local search and a greedy randomized adaptive search procedure. Computational experiments are carried out using random-generated instances. Results show the efficiency and efficacy of the proposed metaheuristics, and provide insights into the impact of the deterioration factor in flow shop scheduling problems. (C) 2019 Elsevier Ltd. All rights reserved.
机译:这项研究解决了与位置相关的处理时间的流水车间排序问题。这项工作的目的是最大程度地减少延迟,并分析恶化因素的影响。这项工作与文献中的现有工作不同,因为处理时间本身不会恶化。相反,资源会恶化。该模型可以分析手工密集型制造系统中的工人疲劳,例如在奢侈品或纺织工业中。对该问题进行了案例研究。此外,提出了一种数学模型,一种排序启发式算法,两种改进启发式方法,以及两种元启发式方法,即迭代局部搜索和贪婪随机自适应搜索程序。使用随机生成的实例进行计算实验。结果显示了所提出的元启发式方法的效率和功效,并提供了对恶化因素在流水车间调度问题中的影响的见解。 (C)2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号