Narrow search
Showing 1 - 10 of 936
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
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
Wei, Hongjun; Yuan, Jinjiang - In: Operations research letters 47 (2019) 1, pp. 41-46
Persistent link: https://www.econbiz.de/10011991332
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
Scheduling with partial rejection
Liu, Zhixin - In: Operations research letters 48 (2020) 4, pp. 524-529
Persistent link: https://www.econbiz.de/10012294822
Cover Image
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
Choi, Byung-Cheon; Min, Yunhong; Park, Myoung-Ju - In: Operations research letters 47 (2019) 5, pp. 433-437
Persistent link: https://www.econbiz.de/10012110608
Cover Image
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
Zhao, Qiulan; Yuan, Jinjiang - In: Operations research letters 47 (2019) 6, pp. 607-610
Persistent link: https://www.econbiz.de/10012131895
Cover Image
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
Epstein, Leah; Levin, Asaf - In: Operations research letters 44 (2016) 6, pp. 772-774
Persistent link: https://www.econbiz.de/10011622238
Cover Image
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
Sgall, Jiří; Woeginger, Gerhard J. - In: Operations research letters 51 (2023) 6, pp. 583-590
Persistent link: https://www.econbiz.de/10014465730
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