Sciweavers

5214 search results - page 101 / 1043
» The Online Specialization Problem
Sort
View
EOR
2007
103views more  EOR 2007»
13 years 9 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
HYBRID
2009
Springer
14 years 3 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
APPROX
2004
Springer
117views Algorithms» more  APPROX 2004»
14 years 2 months ago
The Greedy Algorithm for the Minimum Common String Partition Problem
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
Marek Chrobak, Petr Kolman, Jiri Sgall
WSC
2008
13 years 11 months ago
Mixed model assembly line balancing problem with fuzzy operation times and drifting operations
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
Weida Xu, Tianyuan Xiao
IPCO
2008
114views Optimization» more  IPCO 2008»
13 years 10 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi