Please use this identifier to cite or link to this item: http://ir.library.ui.edu.ng/handle/123456789/1803
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOladokun, V. O-
dc.contributor.author.Charles-Owaba, O. E.-
dc.date.accessioned2018-10-10T14:59:12Z-
dc.date.available2018-10-10T14:59:12Z-
dc.date.issued2008-
dc.identifier.issn1551-7624-
dc.identifier.otherThe Pacific Journal of Science and Technology 9(1), pp. 36-44-
dc.identifier.otherui_art_oladokun_sequence_2008-
dc.identifier.urihttp://ir.library.ui.edu.ng/handle/123456789/1803-
dc.description.abstractThe 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 highlighteden_US
dc.language.isoenen_US
dc.publisherAkamai University, Hilo, HI, USAen_US
dc.subjectMSP. machine set up problem.en_US
dc.subjecttraveling salesman problem.en_US
dc.subjectcombinatorialopurruzanon.en_US
dc.subjectenglneertngprtnctpalsen_US
dc.titleThe sequence dependent machine set-up problem: a brief overview.en_US
dc.typeArticleen_US
Appears in Collections:scholarly works

Files in This Item:
File Description SizeFormat 
(9)ui_art_oladokun_sequence_2008_0506.pdf6.43 MBAdobe PDFThumbnail
View/Open


Items in UISpace are protected by copyright, with all rights reserved, unless otherwise indicated.