sequence dependent single machine di oladokun victor (5 risultati)

Taschenbuch. Condizione: Neu. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 128 pp. Englisch.

Paperback. Condizione: Like New. Like New. book.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Oladokun VictorV.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 .

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 128 pp. Englisch.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.