• 论文 • 上一篇    下一篇

转包费用有限的两机流水作业排序问题

陈荣军1,唐国春2   

  1. 1. 常州工学院理学院, 常州 213032; 2. 上海第二工业大学管理工 程研究所, 上海 201209
  • 出版日期:2019-09-25 发布日期:2019-12-05

陈荣军,唐国春. 转包费用有限的两机流水作业排序问题[J]. 系统科学与数学, 2019, 39(9): 1462-1470.

CHEN Rongjun1,TANG Guochun. Two-Machine Flow Shop Scheduling with Limited Cost of Outsourcing[J]. Journal of Systems Science and Mathematical Sciences, 2019, 39(9): 1462-1470.

Two-Machine Flow Shop Scheduling with Limited Cost of Outsourcing

CHEN Rongjun1 ,TANG Guochun2   

  1. 1. School of Science, Changzhou Institute of Technology, Changzhou 213032; 2. Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209
  • Online:2019-09-25 Published:2019-12-05

考虑工件可以转包的两机流水作业排序问题, 假设转包费用有一个上限, 极小化未转包工件最大完工时间或未转包工件总完工时间与转包费用之和, 分析问题的 复杂性并设计拟多项式时间算法.

In this paper, two-machine flow shop scheduling model with outsourcing is considered. In the model, the outsourcing cost has an upper bound which is not permitted to exceed. Two kind of objectives are studied, i.e., minimizing the makespan of the jobs in-house, and minimizing the sum of total weighted completion times and the transportation cost of in-house jobs. For the model with different objectives, we analyze the complexity and design pseudo-polynomial algorithms.

()
[1] 陈荣军,唐国春. 同类机下的供应链排序及转包策略*[J]. 系统科学与数学, 2012, 32(1): 53-61.
[2] 张新功;严广乐;张峰;唐国春. 一种新的学习效应的机器排序问题研究[J]. 系统科学与数学, 2010, 30(10): 1359-1367.
阅读次数
全文


摘要