Narrow search
Showing 1 - 10 of 300,321
Cover Image
Serial-batching scheduling with two agents to minimize makespan and maximum cost
He, Cheng; Xu, ChunQing; Lin, Hao - In: Journal of scheduling : JOS 23 (2020) 5, pp. 609-617
Persistent link: https://www.econbiz.de/10012299986
Cover Image
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
Shabtay, Dvir - In: European journal of operational research : EJOR 233 (2014) 1, pp. 64-74
Persistent link: https://www.econbiz.de/10010224939
Cover Image
On scheduling with non-increasing time slot cost to minimize total weighted completion time
Zhao, Yingchao; Qi, Xiangtong; Li, Minming - In: Journal of scheduling 19 (2016) 6, pp. 759-767
Persistent link: https://www.econbiz.de/10011645877
Cover Image
Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
Gawiejnowicz, Stanisław; Suwalski, Cezary - In: Computers & operations research : and their … 52 (2014), pp. 135-146
Persistent link: https://www.econbiz.de/10011281370
Cover Image
Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time
Ma, Ran; Yuan, Jinjiang - In: International journal of production economics 158 (2014), pp. 114-119
Persistent link: https://www.econbiz.de/10010438008
Cover Image
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
Tao, Jiping - In: Computers & operations research : and their … 43 (2014), pp. 215-224
Persistent link: https://www.econbiz.de/10010241956
Cover Image
A scheduling problem with three competing agents
Lee, Wen-chiung; Wang, Jen-ya - In: Computers & operations research : and their … 51 (2014), pp. 208-217
Persistent link: https://www.econbiz.de/10010408858
Cover Image
Minimising total weighted completion time on batch and unary machines with incompatible job families
Huang, Zewen; Shi, Zhongshun; Shi, Leyuan - In: International journal of production research 57 (2019) 2, pp. 567-581
Persistent link: https://www.econbiz.de/10012183688
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
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