Research on m-machine flow shop scheduling with truncated learning effects

被引：52

作者：

Wang, Ji-Bo ^{[1
]}

Liu, Feng ^{[2
]}

Wang, Jian-Jun ^{[3
]}

机构：

[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Liaoning, Peoples R China

[2] Dongbei Univ Finance & Econ, Sch Management Sci & Engn, Dalian 116025, Peoples R China

[3] Dalian Univ Technol, Fac Management & Econ, Dalian 116024, Peoples R China

来源：

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2019年 / 26卷 / 03期

基金：

中国国家自然科学基金;

关键词：

scheduling; branch-and-bound algorithm; heuristic algorithm; learning effect; flow shop; WORST-CASE ANALYSIS; PERMUTATION FLOWSHOP; ALGORITHM; SEARCH; OPTIMIZATION; MINIMIZE;

D O I：

10.1111/itor.12323

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The permutation flow shop problems with truncated exponential sum of logarithm processing times based and position-based learning effects are considered in this study. The objective is to minimize makespan and total weighted completion time, respectively. Several heuristics and a branch-and-bound algorithm are proposed in this paper. The tight worst-case bounds of some simple heuristics are also given. Numerical experiments are tested to evaluate the performance of the heuristics and branch-and-bound algorithm.

引用

页码：1135 / 1151

页数：17

共 31 条

[1] A state-of-the-art review on scheduling with learning effects
Biskup, Dirk
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 188 (02) : 315 - 329
[2] Single machine scheduling problems with exponentially time-dependent learning effects
Cheng, Mingbao
Tadikamalla, Pandu R.
Shang, Jennifer
Zhang, Bixi
[J]. JOURNAL OF MANUFACTURING SYSTEMS, 2015, 34 : 60 - 65
[3] Two-machine flowshop scheduling with a truncated learning function to minimize the makespan
Cheng, T. C. E.
Wu, Chin-Chia
Chen, Juei-Chao
Wu, Wen-Hsiang
Cheng, Shuenn-Ren
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 79 - 86
[4] A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
Defersha, Fantahun M.
[J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2015, 22 (04) : 669 - 691
[5] Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
Dhouib, E.
Teghem, J.
Loukil, T.
[J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2013, 20 (02) : 213 - 232
[6] An efficient constructive heuristic for flowtime minimisation in permutation flow shops
Framinan, JM
Leisten, R
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2003, 31 (04): : 311 - 317
[7] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION
GONZALEZ, T
SAHNI, S
[J]. OPERATIONS RESEARCH, 1978, 26 (01) : 36 - 52
[8] Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues
Juan, Angel A.
Lourenco, Helena R.
Mateo, Manuel
Luo, Rachel
Castella, Quim
[J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2014, 21 (01) : 103 - 126
[9] Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
Kuo, Wen-Hung
Hsu, Chou-Jung
Yang, Dar-Li
[J]. INFORMATION SCIENCES, 2012, 184 (01) : 282 - 297
[10] Permutation flowshop scheduling to minimize the total tardiness with learning effects
Lee, Wen-Chiung
Chung, Yu-Hsiang
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 327 - 334

← 1 2 3 4 →