Sciweavers

283 search results - page 17 / 57
» A survey of scheduling problems with setup times or costs
Sort
View
AAAI
2008
13 years 10 months ago
Online Learning with Expert Advice and Finite-Horizon Constraints
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
Branislav Kveton, Jia Yuan Yu, Georgios Theocharou...
IPPS
2009
IEEE
14 years 2 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
WOA
2007
13 years 8 months ago
A Swarm Intelligence Method Applied to Manufacturing Scheduling
—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup ti...
Davide Anghinolfi, Antonio Boccalatte, Alberto Gro...
AIPS
2006
13 years 9 months ago
Incremental Scheduling to Maximize Quality in a Dynamic Environment
We present techniques for incrementally managing schedules in domains where activities accrue quality as a function of the time and resources allocated to them and the goal is to ...
Anthony Gallagher, Terry L. Zimmerman, Stephen F. ...
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 1 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan