The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …

We shall present approximation algorithms for a variety of facility location problems. One of
the most well-studied problems in the Operations Research literature is the …

In this paper we introduce two general techniques for the design and analysis of
approximation algorithms for 𝒩𝒫-hard scheduling problems in which the objective is to …

Mobile crowdsensing is a new paradigm in which a crowd of mobile users exploit their
carried smart phones to conduct complex sensing tasks. In this paper, we focus on the …

Mobile crowdsensing is a new paradigm in which a crowd of mobile users exploit their
carried smart devices to conduct complex computation and sensing tasks in mobile social …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to
minimize a given objective. In resource-constrained project scheduling, the jobs additionally …

We present the first optimal randomized online algorithms for the TCP acknowledgment
problem [5] and the Bahncard problem [7]. These problems are well-known to be …