Makespan and Total Flow Time Minimization in a Basic Re-entrant Shop for Series Production

摘要：

This paper addresses a shop scheduling problem in a real manufacturing company. A set of n identical jobs are to be processed on m machines. Every job visits one of the machines more than once. This problem is even not in the class NP. We give an optimal schedule to minimize the makespan. Since the total °ow time depends on the relations between the processing times. We decompose this problem into sub-problems according to the relations between the processing times. We provide optimal solution for some special cases. For other cases, we prove some dominance properties which allow to consider a part of schedules to find an optimal one.

关键词： Re-entrant shop makespan total flow time series production scheduling

作者: Feng Chu Chengbin Chu Caroline Desprez

作者单位: Université de technologie de Troyes,Institut Charles Delaunay,FRE CNRS 2848,Laboratoire doptimisati Université de technologie de Troyes,Institut Charles Delaunay,FRE CNRS 2848,Laboratoire doptimisati

会议类型: 国际会议

会议名称: 工业工程与系统管理2007年国际会议(International Conference on Industrial Engineering and Systems Management)(IESM 2007)

会议地点: 北京

会议语种:英文

在线出版日期: 2007-05-30（万方平台首次上网日期，不代表论文的发表时间）