Sciweavers

908 search results - page 46 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
EOR
2006
44views more  EOR 2006»
15 years 1 months ago
The multiple-job repair kit problem
The repair kit problem is that of finding the optimal set of parts in the kit of a repairman. An important aspect of this problem, in many real-life situations, is that several jo...
Ruud H. Teunter
EOR
2010
96views more  EOR 2010»
15 years 2 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...
EOR
2010
113views more  EOR 2010»
14 years 11 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
FLAIRS
2007
15 years 4 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
INFOCOM
2005
IEEE
15 years 7 months ago
Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
Arindam Kumar Das, Robert J. Marks II, Payman Arab...