Narrow search
Showing 1 - 10 of 1,609
Cover Image
Minimizing total completion time on a single machine with step improving jobs
Kim, Eun-Seok; Oron, Daniel - In: Journal of the Operational Research Society : OR 66 (2015) 9, pp. 1481-1490
Persistent link: https://www.econbiz.de/10011417461
Cover Image
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi; Chen, Yong; Zhang, An - In: International journal of production economics 146 (2013) 1, pp. 293-299
Persistent link: https://www.econbiz.de/10010221617
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
Normal-form preemption sequences for an open problem in scheduling theory
Chen, Bo; Coffman, Ed; Dereniowski, Dariusz; Kubiak, Wieslaw - In: Journal of scheduling 19 (2016) 6, pp. 701-728
Persistent link: https://www.econbiz.de/10011645864
Cover Image
No-wait scheduling of position dependent jobs and adjustable processing intervals
Oron, Daniel - In: Journal of the Operational Research Society : OR 66 (2015) 5, pp. 732-736
Persistent link: https://www.econbiz.de/10011302307
Cover Image
Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
Wang, Shijin; Wu, Ruochen; Chu, Feng; Yu, Jianbo - In: Computers & operations research : and their … 118 (2020), pp. 1-17
Persistent link: https://www.econbiz.de/10012236769
Cover Image
Scheduling equal length jobs with eligibility restrictions
Hong, Juntaek; Lee, Kangbok; Pinedo, Michael - In: Project management and scheduling, (pp. 295-314). 2020
Persistent link: https://www.econbiz.de/10012157297
Cover Image
A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Rakrouki, Mohamed Ali; Kooli, Anis; Chalghoumi, Sabrine; … - In: Operational research : an international journal 20 (2020) 1, pp. 21-35
Persistent link: https://www.econbiz.de/10012172846
Cover Image
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Chen, Rubing; Yuan, Jinjiang; Gao, Yuan - In: Journal of scheduling 22 (2019) 5, pp. 581-593
Persistent link: https://www.econbiz.de/10012117028
Cover Image
Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
Nguyen, Nhan-Quy; Yalaoui, Farouk; Amodeo, Lionel; … - In: Computers & operations research : and their … 90 (2018), pp. 110-124
Persistent link: https://www.econbiz.de/10011775275