Search Results - subject:"Total weighted completion time"

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

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

Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

He, Cheng; Lin, Hao; Wang, Xiumei - In: 4OR : a quarterly journal of operations research 12 (2014) 1, pp. 87-93

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

Minimizing total weighted completion time with an unexpected machine unavailable interval

Huo, Yumei; Reznichenko, Boris; Zhao, Hairong - In: Journal of scheduling 17 (2014) 2, pp. 161-172

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

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

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

A tight 2-approximation for preemptive stochastic scheduling

Megow, Nicole; Vredeveld, Tjark - In: Mathematics of operations research 39 (2014) 4, pp. 1297-1310

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

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) C, pp. 114-119

In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f1 and f2 simultaneously. An online algorithm A is called (ρ1,ρ2)-competitive for minimizing f1 and f2 if A is ρ1-competitive for minimizing f1 and ρ2-competitive for minimizing f2. A...

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

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Nessah, Rabia; Kacem, Imed - IÉSEG School of Management, Université Catholique de Lille - 2009

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

Minimizing total weighted completion times subject to precedence constraints by dynamic programming

Drexl, Andreas; Kimms, Alf - 1998

) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas …In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total …

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