A Hybrid Genetic Algorithm to Solve a Logt-Sizing and Scheduling Problem

Staggemeier, Andrea and Clark, Alistair and Aickelin, Uwe and Smith, Jim (2002) A Hybrid Genetic Algorithm to Solve a Logt-Sizing and Scheduling Problem. In: 16th Triennial Conference of the International Federation of Operational Research Societies (IFORS 2002), Edinburgh, UK.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


Abstract: This paper reports a lot-sizing and scheduling problem, which minimizes inventory and backlog costs on m parallel machines with sequence-dependent set-up times over t periods. Problem solutions are represented as product subsets ordered and/or unordered for each machine m at each period t. The optimal lot sizes are determined applying a linear program. A genetic algorithm searches either over ordered or over unordered subsets (which are implicitly ordered using a fast ATSP-type heuristic) to identify an overall optimal solution. Initial computational results are presented, comparing the speed and solution quality of the ordered and unordered genetic algorithm approaches.

Item Type:Conference or Workshop Item (Paper)
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:605
Deposited By:Aickelin, Professor Uwe
Deposited On:22 Oct 2007 14:42
Last Modified:22 Oct 2007 14:42

Repository Staff Only: item control page