Sciweavers

299 search results - page 26 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
EOR
2010
107views more  EOR 2010»
15 years 2 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...
ENDM
2000
116views more  ENDM 2000»
15 years 2 months ago
Conceptual Models for Combined Planning and Scheduling
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
Roman Barták
114
Voted
CLUSTER
2008
IEEE
15 years 9 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
123
Voted
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 2 months ago
Managing Uncertainty: A Case for Probabilistic Grid Scheduling
The Grid technology is evolving into a global, service-orientated architecture – a universal platform for delivering future high demand computational services. Strong adoption of...
Aleksandar Lazarevic, Lionel Sacks, Ognjen Prnjat
SPAA
2010
ACM
15 years 2 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam