Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

A subtour-free set-sequencing algorithm based computer software for solving the machine set-up problem

The machine set-up problem (MSP) is that of determining an optimal sequence that a set of N operations will be performed by a general- purpose facility. In order to minimize tile total cost/time of re-setting the facility. Though the MSP is experienced in many small scale industrial situations many...

Full description

Saved in:
Bibliographic Details
Format: Article
Published: 2007
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000njm a2000000a 4500
001 oai:repository.ui.edu.ng:123456789/1795
042 |a dc 
720 |a Charles-owaba, O. E.  |e author 
720 |a Oladokun, V. O.  |e author 
260 |c 2007 
520 |a The machine set-up problem (MSP) is that of determining an optimal sequence that a set of N operations will be performed by a general- purpose facility. In order to minimize tile total cost/time of re-setting the facility. Though the MSP is experienced in many small scale industrial situations many of the existing algorithm are programmed to run on super computers or massively parallel computer processors which are often not available for small scale industrial environment in developing economies. In this study a Subtour-free Set Sequencing Algorithm based software for solving real life medium size machine set-up problem on personal computers was developed and tested The computational time curve exhibited a polynomial growth for the range of problems solved and the solution system was shown to be practicable 
024 8 |a Nigerian Journal of Engineering Research and Development 6(4), pp. 1-10 
024 8 |a ui_art_charles-owaba_subtour-free_2007 
024 8 |a http://ir.library.ui.edu.ng/handle/123456789/1795 
245 0 0 |a A subtour-free set-sequencing algorithm based computer software for solving the machine set-up problem