Search Results - subject:"total weighted completion time"

Rescheduling with new orders under bounded disruption

Lendl, Stefan; Pferschy, Ulrich; Rener, Elena - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 6, pp. 1654-1675

Persistent link: https://www.econbiz.de/10015164631

Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times

Nouinou, Hajar; Arbaoui, Taha; Yalaoui, Alice - In: International journal of production research 62 (2024) 6, pp. 2272-2285

Persistent link: https://www.econbiz.de/10014546403

Rescheduling for new orders on a single machine with rejection

Fang, Kan; Luo, Wenchang; Pinedo, Michael; Jin, Miaomiao; … - In: Journal of the Operational Research Society 75 (2024) 2, pp. 346-360

Persistent link: https://www.econbiz.de/10014555675

A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs

Chen, Jianfu; Chu, Chengbin; Sahli, Abderrahim; Li, Kai - In: European journal of operational research : EJOR 316 (2024) 3, pp. 856-872

Persistent link: https://www.econbiz.de/10014576750

Optimal algorithms for scheduling under time-of-use tariffs

Chen, Lin; Megow, Nicole; Rischke, Roman; Stougie, Leen; … - In: Annals of Operations Research 304 (2021) 1-2, pp. 85-107

(weighted) completion time on a single machine, we present a polynomial-time algorithm that computes for any given sequence of … contribute optimal polynomial-time algorithms and best possible approximation algorithms. For the problem of minimizing the total …

Persistent link: https://www.econbiz.de/10014501748

Robust permutation flow shop total weighted completion time problem : solution and application to the oil and gas industry

Levorato, Mario; Sotelo, David; Figueiredo, Rosa; … - In: Computers & operations research : and their … 151 (2023), pp. 1-18

Persistent link: https://www.econbiz.de/10014234874

An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect

Zhang, Zhe; Song, Xiaoling; Gong, Xue; Yin, Yong; Lev, … - In: International journal of production research 61 (2023) 6, pp. 1938-1954

Persistent link: https://www.econbiz.de/10014230532

An exact algorithm for the preemptive single machine scheduling of equal-length jobs

Fomin, Artem; Goldengorin, Boris - In: Computers & operations research : and their … 142 (2022), pp. 1-11

Persistent link: https://www.econbiz.de/10013197711

Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time

Li, Haidong; Li, Zhen; Zhao, Yaping; Xu, Xiaoyun - In: Journal of the Operational Research Society 72 (2021) 8, pp. 1726-1736

Persistent link: https://www.econbiz.de/10012609223

Efficient mixed integer programming models for family scheduling problems

Lin, Meng-Ye; Kuo, Yarlin - In: Operations Research Perspectives 4 (2017), pp. 49-55

models, to solve single machine family scheduling problems. The objectives are total weighted completion time and maximum … optimal sequence properties are included in the models. For the total weighted completion time problems, the best model solves …

Persistent link: https://www.econbiz.de/10011825942