Narrow search
Showing 1 - 10 of 212
Cover Image
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Wan, Long; Yuan, Jinjiang - In: Operations research letters 41 (2013) 4, pp. 363-365
Persistent link: https://www.econbiz.de/10009772782
Cover Image
Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
Davis, James M.; Gandhi, Rajiv; Kothari, Vijay H. - In: Operations research letters 41 (2013) 2, pp. 121-125
Persistent link: https://www.econbiz.de/10009727797
Cover Image
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
Gicquel, C.; Minoux, Michel; Dallery, Y. - In: Operations research letters 37 (2009) 1, pp. 32-36
Persistent link: https://www.econbiz.de/10003846224
Cover Image
Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
Drwal, Maciej; Rischke, Roman - In: Operations research letters 44 (2016) 3, pp. 354-358
Persistent link: https://www.econbiz.de/10011506133
Cover Image
On index policies for stochastic minsum scheduling
Eberle, Franziska; Fischer, Felix; Matuschke, Jannik; … - In: Operations research letters 47 (2019) 3, pp. 213-218
Persistent link: https://www.econbiz.de/10012017650
Cover Image
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
Correa, José; Verdugo, Victor; Verschae, José - In: Operations research letters 44 (2016) 4, pp. 469-473
Persistent link: https://www.econbiz.de/10011535355
Cover Image
A (2+⋳) approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Sitters, René; Yang, Liyan - In: Operations research letters 46 (2018) 4, pp. 438-442
Persistent link: https://www.econbiz.de/10011916166
Cover Image
Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
Jäger, Sven Joachim - In: Operations research letters 46 (2018) 5, pp. 505-509
Persistent link: https://www.econbiz.de/10011936683
Cover Image
A note on Pareto minimizing total completion time and maximum cost
Gao, Yuan; Yuan, Jinjiang - In: Operations research letters 43 (2015) 1, pp. 80-82
Persistent link: https://www.econbiz.de/10010486293
Cover Image
Pseudo lower bounds for online parallel machine scheduling
Tan, Zhiyi; Li, Rongqi - In: Operations research letters 43 (2015) 5, pp. 489-494
Persistent link: https://www.econbiz.de/10011386448