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...
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...
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....
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...
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...