The Sequence Dependent Single Machine Set-Up Time Problem
The Subtour-Free Set-Sequencing Algorithm Solution Approach
Versandkostenfrei!
Versandfertig in 6-10 Tagen
38,99 €
inkl. MwSt.
PAYBACK Punkte
19 °P sammeln!
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 optimis...
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.
Andere Kunden interessierten sich für
