Sciweavers

66 search results - page 6 / 14
» A Hybrid Electromagnetism-Like Algorithm for Single Machine ...
Sort
View
AAAI
1998
15 years 4 months ago
Multi Machine Scheduling: An Agent-Based Approach
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
Rama Akkiraju, Pinar Keskinocak, Sesh Murthy, Fred...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 3 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
IPL
2008
80views more  IPL 2008»
15 years 3 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 6 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
EOR
2008
91views more  EOR 2008»
15 years 3 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...