Skip to main content
Article thumbnail
Location of Repository

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

By Andrea Staggemeier, Alistair Clark, Uwe Aickelin and Jim Smith

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

OAI identifier: oai:eprints.nottingham.ac.uk:605
Provided by: Nottingham ePrints

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.