
The Sequence Dependent Single Machine Set-Up Time Problem
The Subtour-Free Set-Sequencing Algorithm Solution Approach
LAP Lambert Academic Publishing
Published on 20. June 2011
Book
Paperback/Softback
128 pages
978-3-8443-8268-6 (ISBN)
Description
The sequence dependent single 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 the total cost/time of re-setting the facility. The MSP, which belong to a class of problems known as NP-hard, has both industrial and theoretical relevance in combinatorial optimization. Although much of the work on the MSP is motivated by its direct applications the fact that the MSP provides an ideal platform for the study of general methods that can be applied to a wide range of discrete optimisation problems and concepts has provided impetus for continued interests in new MSP solution algorithms. This book describes the development of a new solution framework for the sequence dependent single machine set-up problem (MSP) based on the concept of set-sequencing.
More details
Language
English
Place of publication
Germany
Product notice
Paperback (trade)
Unsewn / adhesive bound
Dimensions
Height: 220 mm
Width: 150 mm
Thickness: 8 mm
Weight
209 gr
ISBN-13
978-3-8443-8268-6 (9783844382686)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
V.O.Oladokun, B.Sc.(Ife), MSc.,Ph.D.(Ibadan), has his research interest in the areas of operation/production systems modelling and optimization while O.E. Charles-Owaba, B.Sc. MSc, Ph.D.(Texas Tech.),is a Professor of Industrial & System Engineering. They lecture at the Department of Industrial Engineering, University of Ibadan,Nigeria.