Andrea Staggemeier
A Hybrid Genetic Algorithm to Solve a Logt-Sizing and Scheduling Problem
Staggemeier, Andrea; Clark, Alistair; Aickelin, Uwe; Smith, Jim
Authors
Alistair Clark
Uwe Aickelin
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.
Citation
Staggemeier, A., Clark, A., Aickelin, U., & Smith, J. A Hybrid Genetic Algorithm to Solve a Logt-Sizing and Scheduling Problem.
Conference Name | 16th Triennial Conference of the International Federation of Operational Research Societies (IFORS 2002) |
---|---|
Deposit Date | Oct 22, 2007 |
Publicly Available Date | Mar 29, 2024 |
Peer Reviewed | Peer Reviewed |
Public URL | https://nottingham-repository.worktribe.com/output/1022946 |
Files
02ifors_andrea.pdf
(64 Kb)
PDF
You might also like
A Method for Evaluating Options for Motif Detection in Electricity Meter Data
(2018)
Journal Article
Using simulation to incorporate dynamic criteria into multiple criteria decision making
(2017)
Journal Article
THCluster: herb supplements categorization for precision traditional Chinese medicine
(2017)
Conference Proceeding
Measuring behavioural change of players in public goods game
(2017)
Book Chapter
Robust datamining
(2017)
Conference Proceeding
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: digital-library-support@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search