...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>European Journal of Operational Research >Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
【24h】

Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

机译：流水车间调度算法，用于最小化完成时间方差和与公共到期日相比完成时间偏差的平方和

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider two problems of m-machine flow shop scheduling in this paper: one, with the objective of minimizing the variance of completion times of jobs, and the other with the objective of minimizing the sum of squares of deviations of job completion times from a common due date. Lower bounds on the sum of squares of derivations of job completion times from the mean completion time of jobs for a given partial sequence are first presented. Using these lower bounds, a branch and bound algorithm based on breadth-first search procedure for scheduling n jobs on m-machines with the objective of minimizing completion time variance (CTV) is developed to obtain the best permutation sequence. We also present two lower bounds and thereafter, a branch and bound algorithm with the objective of minimizing the sum of squares of deviations of job completion times from a given common due date (called the MSD problem). The computational experience with the working of the two proposed branch and bound algorithms is also reported. Two heuristics, one for each of the two problems, are developed. The computational experience on the evaluation of the heuristics is discussed.
机译：我们在本文中考虑了m机器流水车间调度的两个问题：一个是为了使作业完成时间的方差最小化，另一个是为了使作业完成时间与a的偏差平方和最小化。共同到期日。对于给定的部分序列，首先给出了从工作平均完成时间到工作完成时间的导数平方和的下界。利用这些下限，开发了一种基于广度优先搜索过程的分支定界算法，用于在m机上调度n个作业，目的是最小化完成时间方差（CTV），以获得最佳置换序列。我们还提出了两个下界，其后提出了一种分支定界算法，其目的是使工作完成时间与给定的共同到期日之间的偏差平方和最小化（称为MSD问题）。还报告了两种提出的分支定界算法的工作经验。开发了两种启发式方法，分别针对两个问题。讨论了启发式评估的计算经验。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号