期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 169, 期 -, 页码 76-88出版社
ELSEVIER
DOI: 10.1016/j.ijpe.2015.07.027
关键词
Distributed assembly permutation flowshop; Variable neighborhood descent; Iterated greedy; Sequence dependent setup times
资金
- Spanish Ministry of Economy and Competitiveness, under project RESULT - Realistic Extended Scheduling Using Light Techniques [DPI2012-36243-C02-01]
- European Union
- FEDER
- Universitat Politecnica de Valencia [PAID/2012/202]
- Spanish Ministry of Economy and Competitiveness [TRA2013-48180-C3-3-P]
We consider a Distributed Assembly Permutation Flowshop Scheduling Problem with sequence dependent setup times and the objective of makespan minimization. The problem consists of two stages, production and assembly. The first stage comprises f identical factories, where each factory is a flowshop that produces jobs which are later assembled into final products through an identical assembly program in a second assembly stage made by a single machine. Both stages have sequence dependent setup times. This-is a realistic and complex problem and therefore, we propose two simple heuristics and two metaheuristics to solve it. A complete calibration and analysis through a Design Of Experiments (DOE) approach is carried out. In the process, important knowledge of the studied problem is obtained as well as some simplifications for the powerful Iterated Greedy methodology which results in a simpler approach with less parameters. Finally, the performance of the proposed methods is compared through extensive computational and statistical experiments. (C) 2015 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据