首页 | 本学科首页   官方微博 | 高级检索  
     检索      

最优公共交货期单机提前/拖后调度和对应的批次送货
引用本文:吴超超,顾幸生.最优公共交货期单机提前/拖后调度和对应的批次送货[J].华东理工大学学报(自然科学版),2004,30(2):211-215.
作者姓名:吴超超  顾幸生
作者单位:华东理工大学自动化研究所,上海,200237;华东理工大学自动化研究所,上海,200237
基金项目:国家自然科学基金(60274043),国家高技术研究发展计划项目(2002AA412610)
摘    要:本文考虑了一个包含工件生产和工件送货的单机调度问题。目标是寻找所有工件的公共交货期和每个工件的送货时间使得工件所受到惩罚(提前/拖后惩罚,送货费用等)的值最小。完成的工件按照批次进行送货,所有在公共交货期前完工的工件在最优交货期时间一起交付,对批次送货没有量的约束。本文确定了最优公共交货期,并给出了相应的排序。

关 键 词:单机调度  提前/拖期  公共交货期  批次送货
文章编号:1006-3080(2004)02-0211-05
修稿时间:2003年7月3日

Single Machine Earliness/Tardiness Scheduling Problem with Common Due Date and Batch Delivery Costs
WU Chao-chao,GU Xing-sheng.Single Machine Earliness/Tardiness Scheduling Problem with Common Due Date and Batch Delivery Costs[J].Journal of East China University of Science and Technology,2004,30(2):211-215.
Authors:WU Chao-chao  GU Xing-sheng
Institution:WU Chao-chao,GU Xing-sheng~*
Abstract:We consider a single machine scheduling problem involving both the processing and scheduling of job delivery. A common due date for the jobs and job delivery time need to be determined in order to minimize the sum of the penalties (i.e., earliness penalties, tardiness penalties and delivery costs etc). Finished jobs are delivered in batches and all the jobs completed before or at the due date are delivered in a batch at the optimal due date. There is no capacity limitation on a batch delivery. The optimal common due date is determined and the optimal sequencing is presented.
Keywords:single machine scheduling  earliness/tardiness  common due date  batch delivery
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号