An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
Published Online:16 Jul 2019https://doi.org/10.1287/ijoc.2018.0854
- Cited by
- 22 May 2026 | Journal of Scheduling, Vol. 295
- Discrete Optimization, Vol. 59
- European Journal of Operational Research, Vol. 146
- Transportation Research Part E: Logistics and Transportation Review, Vol. 200
- 1 August 2025 | Naval Research Logistics (NRL), Vol. 95
- 23 September 2024 | Annals of Operations Research, Vol. 344, No. 2-3
- Computers & Operations Research, Vol. 173
- 1 January 2025 | Pesquisa Operacional, Vol. 45
- 26 March 2024 | INFORMS Journal on Computing, Vol. 36, No. 6
- 24 October 2023 | Engineering Optimization, Vol. 56, No. 10
- Computers & Operations Research, Vol. 168
- Engineering Applications of Artificial Intelligence, Vol. 133
- Computers & Chemical Engineering, Vol. 184
- 15 December 2022 | Journal of Heuristics, Vol. 29, No. 1
- Computers & Operations Research, Vol. 148
- Management Science and Engineering, Vol. 11, No. 04
- 12 October 2021 | Advances in Mechanical Engineering, Vol. 13, No. 10
- 20 July 2020 | Soft Computing, Vol. 24, No. 23
- 3 February 2020 | Journal of Scheduling, Vol. 23, No. 4
Volume 32, Issue 1
Winter 2020
Pages 1-198, C2
Article Information
Supplemental Material
Metrics
Information
- Received:May 10, 2016
- Accepted:August 25, 2018
- Published Online:July 16, 2019
Copyright © 2019, INFORMS
Cite as
Daniel Oliveira, Artur Pessoa (2019) An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems. INFORMS Journal on Computing 32(1):90-100.
https://doi.org/10.1287/ijoc.2018.0854
Keywords
