Affiliation of Author(s):经济与管理学院

Journal:J. Oper. Res. Soc. China

Abstract:Scheduling with group technology has been a vivid research area in the past decades. However, group technology with general dual-effect variable processing times needs to be further explored although this kind of group technology plays an important role in some actual manufacturing scenarios. Accordingly, this paper considers group scheduling problems with a kind of general group variable processing times model, where the actual processing time of each job in group is variable due to the dual effect of both the job position and the group position. The objectives of two types of considered problems are to minimize the makespan and the total completion time, respectively. Based on the decomposition analysis, the mathematical logic analysis and the computational complexity proof, it is obtained that the makespan minimization problem and the total completion time minimization problem are both polynomially solvable under the condition that the group number is constant. For three special cases of considered problems, polynomial solving algorithms with lower computational complexity are proposed. © 2017, Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag Berlin Heidelberg.

ISSN No.:2194-668X

Translation or Not:no

Date of Publication:2017-12-01

Co-author:Zhou Dequn,Zhang, Yu-Lin

Correspondence Author:Yu Xianyu