A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
Published Online:21 Jan 2016https://doi.org/10.1287/ijoc.2015.0661
- Cited by
- Computers & Industrial Engineering, Vol. 214
- Computers & Operations Research, Vol. 173
- 26 March 2024 | INFORMS Journal on Computing, Vol. 36, No. 6
- Computers & Chemical Engineering, Vol. 184
- 21 May 2022 | 4OR, Vol. 21, No. 2
- European Journal of Operational Research, Vol. 299, No. 1
- 8 December 2020 | INFORMS Journal on Computing, Vol. 33, No. 2
- 4 July 2019 | Annals of Operations Research, Vol. 285, No. 1-2
- 21 August 2017 | International Transactions in Operational Research, Vol. 27, No. 1
- Computers & Operations Research, Vol. 102
- European Journal of Operational Research, Vol. 266, No. 2
Volume 28, Issue 1
Winter 2016
Pages 1-194
Article Information
Supplemental Material
Metrics
Information
- Received:August 01, 2014
- Accepted:May 01, 2015
- Published Online:January 21, 2016
Copyright © 2016, INFORMS
Cite as
Natashia Boland, Riley Clement, Hamish Waterer (2016) A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems. INFORMS Journal on Computing 28(1):14-30.
https://doi.org/10.1287/ijoc.2015.0661
Keywords
