Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues-Reference-Cited by-同舟云学术

Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues

Published:2013-07-02 Issue:1 Volume:21 Page:103-126
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Juan Angel A.¹,Lourenço Helena R.²,Mateo Manuel³,Luo Rachel¹,Castella Quim¹

Affiliation:

1. Computer Science Department; IN3-Open University of Catalonia; Spain

2. Department of Economics and Business; Universitat Pompeu Fabra; Spain

3. Department of Management; Universitat Politecnica Catalunya; Spain

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Reference52 articles.

1. A self-adaptive local search algorithm for the classical vehicle routing problem;Alabas-Uslu;Expert Systems and Applications,2011

2. New heuristics for no-wait flowshops to minimize makespan;Aldowaisan;Computers and Operations Research,2003

3. A heuristic algorithm for the n job, m machine sequencing problem;Campbell;Management Science,1970

4. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs;Chandrasekharan;European Journal of Operational Research,2004

Cited by 57 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Simultaneous scheduling of jobs and transporters in a hybrid flow shop with collision-free transporter routing: A novel parallel heuristic;Computers & Operations Research;2024-08

2. Seçici Kümelendirilmiş Gezgin Satıcı Problemi ve Matematiksel Formülasyonları;Afyon Kocatepe University Journal of Sciences and Engineering;2024-06-08

3. Deterministic constructive vN-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion;Computers & Operations Research;2024-02

4. Minimizing the maximum tardiness for a permutation flow shop problem under the constraint of sequence independent setup time;RAIRO - Operations Research;2024-01

5. High Performance Algorithms for the Unrelated Parallel Machines Scheduling Problem with a Common Server and Job-Sequence Dependent Setup Times;Communications in Computer and Information Science;2024