☰ Category

Metaheuristics for FJSSP Problems

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

Product Out of Stock Subscription

(Notify me when this product is back in stock)

Rs. 4,835

Availability: Out of stock

 
  • Product Description
 
Scheduling problems occur in all economic domains from computer engineering to manufacturing techniques. These problems are generally defined as decision making problems with the aim of optimizing one or more scheduling criteria. Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. It is more complex than job shop scheduling problem, because of the additional need to determine the assignment of operations to machines. FJSSP is very important in both fields of production management and combinatorial optimization. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution with the traditional techniques. In this connection, suitable algorithms (or) techniques are required to solve the FJSSP. This book provides wide knowledge in the metaheuristics with scheduling field.
Product Specifications
SKU :COC9716
AuthorMuthukannan Rajkumar and P. Asokan
BindingPaperback
Number of Pages176
Publishing Year04/02/15
ISBN978-3659690013
Edition1 st
Book TypeProduction engineering
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece(Paperback)
Product First Available On ClickOnCare.com2015-07-07 00:00:00
0 Review(s)