Please use this identifier to cite or link to this item:
|Title:||The sequence dependent machine set-up problem: a brief overview.|
|Authors:||Oladokun, V. O|
.Charles-Owaba, O. E.
|Keywords:||MSP. machine set up problem.|
traveling salesman problem.
|Publisher:||Akamai University, Hilo, HI, USA|
|Abstract:||The Sequence Dependent Machine Setup Problem (MSP), a class of difficult problems in combinatorial optimization that is representative of a large number of important scientific and engineering problems, has been attracting much attention in recent times. In this study, literature and historical reviews of the MSP were carried out. Some recent developments were reviewed while possible future research directions were also highlighted|
|Appears in Collections:||scholarly works|
Files in This Item:
|(9)ui_art_oladokun_sequence_2008_0506.pdf||6.43 MB||Adobe PDF|
Items in UISpace are protected by copyright, with all rights reserved, unless otherwise indicated.