Sciweavers

908 search results - page 15 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
HEURISTICS
2010
13 years 2 months ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 2 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
COR
2010
99views more  COR 2010»
13 years 7 months ago
A new heuristic to solve the one-warehouse N-retailer problem
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retai...
Beatriz Abdul-Jalbar, Anders Segerstedt, Joaquin S...
COR
2004
85views more  COR 2004»
13 years 7 months ago
A heuristic method for large-scale multi-facility location problems
Abstract. A heuristic method for solving large-scale multi
Yuri Levin, Adi Ben-Israel
HPDC
2008
IEEE
13 years 7 months ago
A two-level scheduler to dynamically schedule a stream of batch jobs in large-scale grids
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...
Marco Pasquali, Ranieri Baraglia, Gabriele Capanni...