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

装卸工人调配问题新解法及其证明
引用本文:宁爱兵,熊小华,马良.装卸工人调配问题新解法及其证明[J].上海理工大学学报,2007,29(2):145-148.
作者姓名:宁爱兵  熊小华  马良
作者单位:1. 上海理工大学,管理学院,上海,200093
2. 上海第二工业大学,计算机学院,上海,201209
基金项目:国家自然科学基金;上海市教委资助项目;上海市重点学科建设项目
摘    要:阐述了现代物流技术中装卸工人调配问题、装卸工问题、限制情况下装卸工问题及其数学模型,证明了装卸工人调配问题与限制情况下装卸工问题的数学模型是等价的.通过分析装卸工人调配问题的数学性质得出该问题的一种新解法并给出其证明.新解法给出了该问题的所有最优解.

关 键 词:装卸工人调配问题  装卸工问题  整数规划  最优解
文章编号:1007-6735(2007)02-0145-04
修稿时间:2006-06-07

New solution and its proof of the loader scheduling problem
NING Ai-bing,XIONG Xiao-hu,MA Liang.New solution and its proof of the loader scheduling problem[J].Journal of University of Shanghai For Science and Technology,2007,29(2):145-148.
Authors:NING Ai-bing  XIONG Xiao-hu  MA Liang
Institution:1. Business School, University of Shanghai for Science and Technology, Shanghai 200093, China ; 2. College of Computer Science and Technology, Shanghai Second Polytechnic University, Shanghai 201209, China
Abstract:The loader scheduling problem,the loader problem,the restricted case of the loader problem and their mathematical models are introduced.A proof that the loader scheduling problem and the restricted case of the loader problem have the same optimal solutions is provided.The mathematical properties of the loader scheduling problem are analysed and all optimal solutions for the loader scheduling problem are presented.
Keywords:loader scheduling problem  loader problem  integer program  optimal solution
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《上海理工大学学报》浏览原始摘要信息
点击此处可从《上海理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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