Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm-Reference-Cited by-同舟云学术

Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm

Published:2019-04 Issue: Volume:104 Page:338-357
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Rauchecker Gerhard,Schryen Guido^ORCID

Funder

Federal Ministry of Education and Research

RWTH Aachen University

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference56 articles.

1. Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking;Aitzai;Int. J. Oper. Res.,2013

2. Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach;Akyol;Int. J. Adv. Manuf. Technol.,2008

3. The third comprehensive survey on scheduling problems with setup times/costs;Allahverdi;Eur. J. Oper. Res.,2015

4. Parallel machine scheduling by column generation;van den Akker;Oper. Res.,1999

5. A review of scheduling research involving setup considerations;Allahverdi;Omega (Westport),1999

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

1. Logic-based Benders decomposition for order acceptance and scheduling on heterogeneous factories with carbon caps;Computers & Operations Research;2024-08

2. Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost;OR Spectrum;2024-07-03

3. Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis;Journal of Parallel and Distributed Computing;2024-05

4. Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times;Omega;2024-02

5. A lightweight semi-centralized strategy for the massive parallelization of branching algorithms;Parallel Computing;2023-07