| 考虑机器调整次数和产品质量的卷烟批量计划和柔性流水车间调度集成问题 |
| |
| 引用本文： | 柴剑彬,刘赫,贝晓强.考虑机器调整次数和产品质量的卷烟批量计划和柔性流水车间调度集成问题[J].运筹与管理,2019,28(10):165-174. |
| |
| 作者姓名： | 柴剑彬 刘赫 贝晓强 |
| |
| 作者单位： | 1. 北京大学 光华管理学院,北京 100871;2. 中国科学院 数学与系统科学研究院,北京 100190;3. 中国科学院大学,北京 100049;4. 清华大学 经济管理学院,北京 100084 |
| |
| 摘 要： | 针对卷烟企业生产中的批量计划和柔性流水车间调度集成问题,构建了整数规划模型,目标函数由卷烟生产时间、生产线调整次数、卷烟质量、库存成本四部分组成。鉴于该问题的NP-hard性,设计遗传算法进行求解,通过合理设计遗传算子,避免不可行解出现。应用某卷烟企业数据得到优化排产结果,与该企业之前依照经验排产方案进行对比,发现优化排程结果在减少品牌转换次数,提高生产的连续性方面具有明显优势。该算法已作为某卷烟企业排产人员的排产参考,应用于排产决策中,取得了良好的效果,对卷烟企业制定排产计划具有一定的实际指导意义。
|
| 关 键 词： | 能力约束批量计划 柔性流水车间调度 遗传算法 最大完工时间 最小化调整次数 |
| 收稿时间： | 2018-03-28 |
Integrated Problem for Lot Sizing and Flexible Flow Shop Scheduling Problem in the Tobacco Industry Considering Setup times and Cigarette Quality |
| |
| CHAI Jian-bin,LIUHe,BEI Xiao-qiang.Integrated Problem for Lot Sizing and Flexible Flow Shop Scheduling Problem in the Tobacco Industry Considering Setup times and Cigarette Quality[J].Operations Research and Management Science,2019,28(10):165-174. |
| |
| Authors: | CHAI Jian-bin LIUHe BEI Xiao-qiang |
| |
| Affiliation: | 1. Guanghua School of Management, Peking University, Beijing100871, China;2. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;3. University of Chinese Academy of Sciences, Beijing 100049, China;4. School of Economics and Management, Tsinghua University, Beijing 100084, China |
| |
| Abstract: | Based on theintegrated problem for lot sizing and flexible flow shop scheduling problem in the tobacco industry, it is formulated as a mixed integer linear model to optimize the lot sizing and scheduling problem whose objective consists of four parts:the production time, the setup times, thecigarette quality and inventory cost. Given the problem is NP-hard, a genetic algorithm is designed to solve this problem based on monolithic method, the infeasible solutions are reduced through the design of genetic operator. Numerical examplesare conducted based on the operation data of a cigarette corporation. The result shows great advantage on decreasing setup times over the previous scheduling plan, which proves the feasibility and validity of our model and algorithm. The effectiveness of the algorithm can be well verified inscheduling decision support for the production of cigarette of real company. |
| |
| Keywords: | capacitated lot sizing problem flexible flow shop scheduling GA setup times |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《运筹与管理》浏览原始摘要信息 |
|
点击此处可从《运筹与管理》下载全文 |
|
