The sequence dependent machine set-up problem: a brief overview.

Please use this identifier to cite or link to this item: http://ir.library.ui.edu.ng/handle/123456789/1803

Full metadata record

DC Field	Value	Language
dc.contributor.author	Oladokun, V. O	-
dc.contributor.author	.Charles-Owaba, O. E.	-
dc.date.accessioned	2018-10-10T14:59:12Z	-
dc.date.available	2018-10-10T14:59:12Z	-
dc.date.issued	2008	-
dc.identifier.issn	1551-7624	-
dc.identifier.other	The Pacific Journal of Science and Technology 9(1), pp. 36-44	-
dc.identifier.other	ui_art_oladokun_sequence_2008	-
dc.identifier.uri	http://ir.library.ui.edu.ng/handle/123456789/1803	-
dc.description.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	en_US
dc.language.iso	en	en_US
dc.publisher	Akamai University, Hilo, HI, USA	en_US
dc.subject	MSP. machine set up problem.	en_US
dc.subject	traveling salesman problem.	en_US
dc.subject	combinatorialopurruzanon.	en_US
dc.subject	englneertngprtnctpals	en_US
dc.title	The sequence dependent machine set-up problem: a brief overview.	en_US
dc.type	Article	en_US
Appears in Collections:	scholarly works

Files in This Item:

File	Description	Size	Format
(9)ui_art_oladokun_sequence_2008_0506.pdf		6.43 MB	Adobe PDF	View/Open

UISpace