A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
Published Online:19 Jan 2015https://doi.org/10.1287/ijoc.2014.0615
- Cited by
- Computers & Industrial Engineering, Vol. 211
- Computers & Operations Research, Vol. 177
- European Journal of Operational Research, Vol. 310, No. 1
- European Journal of Operational Research, Vol. 305, No. 1
- 2 September 2022 | Naval Research Logistics (NRL), Vol. 69, No. 8
- Computers & Operations Research, Vol. 147
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup timesEuropean Journal of Operational Research, Vol. 301, No. 3
- 27 April 2022 | Operations Management Research, Vol. 15, No. 1-2
- 5 September 2020 | Symmetry, Vol. 12, No. 9
- 3 February 2020 | Journal of Scheduling, Vol. 23, No. 4
- Computers & Industrial Engineering, Vol. 145
- 11 April 2020 | Naval Research Logistics (NRL), Vol. 67, No. 4
- Computers & Operations Research, Vol. 104
- 15 December 2017 | Journal of Scheduling, Vol. 22, No. 1
- Computers & Operations Research, Vol. 100
- 21 June 2016 | Journal of Scheduling, Vol. 20, No. 4
- Journal of Manufacturing Systems, Vol. 42
- 10 August 2015 | Transportation Science, Vol. 50, No. 3
Volume 27, Issue 1
Winter 2015
Pages 1-192
Article Information
Supplemental Material
Metrics
Information
- Received:May 01, 2013
- Accepted:June 01, 2014
- Published Online:January 19, 2015
Copyright © 2015, INFORMS
Cite as
Halil Şen, Kerem Bülbül (2015) A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines. INFORMS Journal on Computing 27(1):135-150.
https://doi.org/10.1287/ijoc.2014.0615
Keywords
