首页> 外文期刊>Industrial Engineering & Management Systems >Batch Scheduling Problem with Multiple Due-dates Constraints
【24h】

Batch Scheduling Problem with Multiple Due-dates Constraints

机译:多个到期日期约束的批处理调度问题

获取原文
           

摘要

This paper describes the issue of batch scheduling.In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.
机译:本文介绍了批量调度问题。在食品生产中,由于产品的射精应减少生产,从生产中的报告时间很重要。 产品在各种时期发货,具体取决于卖家的需求,因为卖方的类型已经变得多样化,如超级市,便利店等等。所需的数量必须按时间完成以便运送。 作者考虑到期日期约束并构建算法,找到满足到期日期约束,批量大小约束,库存时间约束和迷你流量的Opti-Mal计划。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号