9783659690013 - Metaheuristics for FJSSP Problems de Rajkumar Muthukannan; Asokan P. (6 resultados)

Taschenbuch. Condición: Neu. Metaheuristics for FJSSP Problems | Muthukannan Rajkumar (u. a.) | Taschenbuch | 176 S. | Englisch | 2015 | LAP LAMBERT Academic Publishing | EAN 9783659690013 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

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

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Rajkumar MuthukannanDr.M.Rajkumar has acquired Ph.D.(Production Engineering)from National Institute of Technology,Tiruchirappalli,India in 2011 and Master of Engineering (Manufacturing Engineering) from Anna University,Chennai in 200.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 176 pp. Englisch.

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