Narrow search
Showing 1 - 10 of 1,505
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) 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 (ρ1,ρ2)-competitive online algorithm A is called nondominated if there is no other …
Persistent link: https://www.econbiz.de/10011076777
Cover Image
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
Cover Image
Optimization of surgery sequencing and scheduling decisions under uncertainty
Denton, Brian; Viapiano, James; Vogl, Andrea - In: Health Care Management Science 10 (2007) 1, pp. 13-24
Persistent link: https://www.econbiz.de/10005719007
Cover Image
From Diffusions to Semimartingales
Aït-Sahalia, Yacine; Jacod, Jean - Princeton University Press
High-frequency trading is an algorithm-based computerized trading practice that allows firms to trade stocks in … mathematical foundations of stochastic processes, describe the primary characteristics of high-frequency financial data, and …
Persistent link: https://www.econbiz.de/10011082748
Cover Image
Preface
Aït-Sahalia, Yacine; Jacod, Jean - Princeton University Press
High-frequency trading is an algorithm-based computerized trading practice that allows firms to trade stocks in … mathematical foundations of stochastic processes, describe the primary characteristics of high-frequency financial data, and …
Persistent link: https://www.econbiz.de/10011082751
Cover Image
High-Frequency Financial Econometrics
Aït-Sahalia, Yacine; Jacod, Jean - Princeton University Press
High-frequency trading is an algorithm-based computerized trading practice that allows firms to trade stocks in … mathematical foundations of stochastic processes, describe the primary characteristics of high-frequency financial data, and …
Persistent link: https://www.econbiz.de/10011082768
Cover Image
Single machine total completion time scheduling problem with workload-dependent maintenance duration
Xu, Dehua; Wan, Long; Liu, Aihua; Yang, Dar-Li - In: Omega 52 (2015) C, pp. 101-106
A single-machine scheduling problem with workload-dependent maintenance duration is considered. The objective is to … to 1, a polynomial time optimal algorithm is proposed. For the case where the derivation of the maintenance duration …
Persistent link: https://www.econbiz.de/10011190632
Cover Image
SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK
WANG, LEIYANG; LIU, ZHAOHUI - In: Asia-Pacific Journal of Operational Research (APJOR) 30 (2013) 01, pp. 1250048-1
In this paper, we consider the scheduling problem in which the jobs are first processed on a single machine and then …-shaped network. The goal is to minimize the makespan. We present a 3/2-approximation algorithm for the identical job size case and a … 2-approximation algorithm for the non-identical job sizes case. …
Persistent link: https://www.econbiz.de/10010882947
Cover Image
Scheduling UET task systems with concurrency on two parallel identical processors
Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov - In: Computational Statistics 52 (2000) 3, pp. 369-387
in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a … algorithms is analysed, and it is shown that the same upper bound is tight for each algorithm of this family. Copyright Springer …
Persistent link: https://www.econbiz.de/10010847568
Cover Image
Scheduling UET task systems with concurrency on two parallel identical processors
Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov - In: Mathematical Methods of Operations Research 52 (2000) 3, pp. 369-387
in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a … algorithms is analysed, and it is shown that the same upper bound is tight for each algorithm of this family. Copyright Springer …
Persistent link: https://www.econbiz.de/10010949999