Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
The sequence dependent machine set-up problem: a brief overview.
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 revi...
Saved in:
| Format: | Article |
|---|---|
| Published: |
2008
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000njm a2000000a 4500 | ||
|---|---|---|---|
| 001 | oai:repository.ui.edu.ng:123456789/1803 | ||
| 042 | |a dc | ||
| 720 | |a Oladokun, V. O |e author | ||
| 720 | |a .Charles-Owaba, O. E. |e author | ||
| 260 | |c 2008 | ||
| 520 | |a 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 | ||
| 024 | 8 | |a 1551-7624 | |
| 024 | 8 | |a The Pacific Journal of Science and Technology 9(1), pp. 36-44 | |
| 024 | 8 | |a ui_art_oladokun_sequence_2008 | |
| 024 | 8 | |a http://ir.library.ui.edu.ng/handle/123456789/1803 | |
| 653 | |a MSP. machine set up problem. | ||
| 653 | |a traveling salesman problem. | ||
| 653 | |a combinatorialopurruzanon. | ||
| 653 | |a englneertngprtnctpals | ||
| 245 | 0 | 0 | |a The sequence dependent machine set-up problem: a brief overview. |