Narrow search
Showing 1 - 10 of 76
Cover Image
Time-indexed formulations and the total weighted tardiness problem
Bigras, Louis-Philippe; Gamache, Michel; Savard, Gilles - In: INFORMS journal on computing : JOC 20 (2008) 1, pp. 133-142
Persistent link: https://www.econbiz.de/10003715961
Cover Image
Single-machine scheduling problems with generalized preemption
Agnetis, Alessandro; Alfieri, Arianna; Nicosia, Gaia - In: INFORMS journal on computing : JOC 21 (2009) 1, pp. 1-12
Persistent link: https://www.econbiz.de/10003896591
Cover Image
Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
Jans, Raf - In: INFORMS journal on computing : JOC 21 (2009) 1, pp. 123-136
Persistent link: https://www.econbiz.de/10003896679
Cover Image
A bucket indexed formulation for nonpreemptive single machine scheduling problems
Boland, Natashia; Clement, Riley; Waterer, Hamish - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 14-30
Persistent link: https://www.econbiz.de/10011453766
Cover Image
Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
Shioura, Akiyoshi; Shakhlevich, Natasha; Strusevič, … - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 148-161
Persistent link: https://www.econbiz.de/10011453812
Cover Image
A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
Şen, Halil; Bülbül, Kerem - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 135-150
Persistent link: https://www.econbiz.de/10010505039
Cover Image
Combining constraint programming and local search for job-shop scheduling
Beck, J. Christopher; Feng, T. K.; Watson, Jean-Paul - In: INFORMS journal on computing : JOC 23 (2011) 1, pp. 1-14
Persistent link: https://www.econbiz.de/10008935651
Cover Image
A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kowalczyk, Daniel; Leus, Roel - In: INFORMS journal on computing : JOC 30 (2018) 4, pp. 768-782
Persistent link: https://www.econbiz.de/10011966567
Cover Image
Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
Wu, Tao; Liang, Zhe; Zhang, Canrong - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 236-258
Persistent link: https://www.econbiz.de/10011878236
Cover Image
An improved branch-cut-and-price algorithm for parallel machine scheduling problems
Oliveira, Daniel Ribeiro de; Pessoa, Artur - In: INFORMS journal on computing : JOC 32 (2020) 1, pp. 90-100
Persistent link: https://www.econbiz.de/10012182988