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

Tools

Staggemeier, Andrea, Clark, Alistair, 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.

Full text not available from this repository.

Abstract

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)
RIS ID: https://nottingham-repository.worktribe.com/output/1022946
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Aickelin, Professor Uwe
Date Deposited: 22 Oct 2007 13:42
Last Modified: 04 May 2020 20:32
URI: https://eprints.nottingham.ac.uk/id/eprint/605

Actions (Archive Staff Only)

Edit View Edit View