Sciweavers

1125 search results - page 57 / 225
» On the job rotation problem
Sort
View
ATAL
2006
Springer
14 years 1 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 3 months ago
Genetic algorithms for the sailor assignment problem
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
Deon Garrett, Joseph Vannucci, Rodrigo Silva, Dipa...
AES
2006
Springer
106views Cryptology» more  AES 2006»
13 years 10 months ago
A grid-enabled problem solving environment for parallel computational engineering design
This paper describes the development and application of a piece of engineering software that provides a Problem Solving Environment (PSE) capable of launching, and interfacing wit...
C. E. Goodyer, Martin Berzins, Peter K. Jimack, L....
ORL
2000
77views more  ORL 2000»
13 years 9 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
COR
2010
164views more  COR 2010»
13 years 10 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz