Sciweavers

120 search results - page 14 / 24
» Tractable Optimal Competitive Scheduling
Sort
View
EOR
2007
101views more  EOR 2007»
14 years 9 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
CEC
2010
IEEE
14 years 10 months ago
Dynamic multi-swarm particle swarm optimizer with sub-regional harmony search
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...
Shi-Zheng Zhao, Ponnuthurai Nagaratnam Suganthan, ...
ICALP
2004
Springer
15 years 3 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
PODC
2009
ACM
15 years 10 months ago
Preventing versus curing: avoiding conflicts in transactional memories
Transactional memories are typically speculative and rely on contention managers to cure conflicts. This paper explores a complementary approach that prevents conflicts by schedul...
Aleksandar Dragojevic, Rachid Guerraoui, Anmol V. ...
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
15 years 10 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....