期刊文献+

公共订单服务平台下制造联盟生产与运输两阶段协同调度成本最小化问题研究

Cost Minimization of Two-stage Cooperative Scheduling Problem of Production and Transportation in Manufacturing Alliance Based on Public Order Service Platform
下载PDF
导出
摘要 云制造模式下为了实现社会制造资源的高效连接,满足不同客户的制造服务需求,制造企业联盟需要建立共享制造资源的公共服务平台,实现制造资源与服务的开放协作、社会资源的高度共享.文章研究了公共服务平台下面向订单生产的制造联盟生产与运输两阶段协同优化问题,同时引入恶化工件概念,首先证明该问题可以简化为经典平行机调度问题,即是NP难问题,然后分析每个制造商处加工订单集合已知情形下最优排序的结构性质,提出改进的列表调度启发式算法,并通过仿真实验说明该算法能够有效整合制造资源、分配制造订单、协同生产与运输. Under the cloud manufacturing model,to achieve efficient connection of social manufacturing resources and meet the manufacturing service demands of different customer,the manufacturing enterprise alliance needs to establish a common service platform that shares manufacturing resources,and realizes open collaboration and high sharing of social resources for manufacturing resources and services.This paper studies the collaborative optimization of production and transportation in manufacturing alliances under the public service platform.At the same time,the concept of deteriorating jobs is introduced in this model.The goal of optimization is to minimize production and transportation costs.This paper proves that the problem is a NP-hard problem,analyzes the structural properties of the problem,and proposes an MLS heuristic algorithm that can effectively integrate manufacturing resources,allocate manufacturing orders,and coordinate production and transportation.A large number of simulation experiments illustrate the effectiveness of the MLS heuristic algorithm.
作者 刘捷先 LIU Jiexian(School of Accounting,Tongling University,Tongling 244061,China;School of Management,Hefei University of Technology,Hefei 230009,China)
出处 《湖北文理学院学报》 2018年第8期5-13,共9页 Journal of Hubei University of Arts and Science
基金 国家社会科学基金资助项目(14BGL004)
关键词 公共订单服务平台 制造联盟 生产与运输协同优化 恶化工件 NP难问题 MLS启发式算法 public order form service platform manufacturing alliance production and transportation collaborative optimization deterioration of the workpiece NP problem MLS heuristic algorithm
  • 相关文献

参考文献4

二级参考文献50

  • 1赵传立,唐恒永.一类资源约束单机排序问题[J].系统工程学报,2004,19(5):451-456. 被引量:12
  • 2杨晓坡.线性减少加工时间的资源约束单机排序问题[J].系统工程与电子技术,2006,28(5):708-711. 被引量:1
  • 3Vickson R G. Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine[J]. Operations Research, 1980, 28: 1155-1167.
  • 4Vickson R G. Two single machine sequencing problems involving controllable job processing times[J]. AIIE Transactions, 1980, 12(3): 258-262.
  • 5Van Wassenhove L, Baker K R. A bicriterion approach to time/cost trade-offs in sequencing[J]. European Journal of Operational Research, 1982, 11:48 -54.
  • 6Janiak A, Janiak W, Lichtenstein W. Resource management in machine scheduling problems: A survey[J]. Decision Making in Manufacturing and Services, 2007, 1(2): 59-89.
  • 7Shabtay D, Steiner G. A survey of scheduling with controllable processing times[J]. Discrete Applied Mathematics, 2007, 155: 1643-1666.
  • 8Nowicki E, Zdrzalka S. A survey of results for sequencing problems with controllable processing times[J]. Discrete Applied Mathematics, 1990, 26: 271-287.
  • 9Janiak A. Single machine scheduling problem with common deadline and resource dependent release dates[J]. European Journal of Operational Research, 1991, 53: 317-325.
  • 10Janiak A. Single machine sequencing with linear models of release dates[J]. Naval Research Logistics, 1998, 45: 99-113.

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部