Des problèmes de planification surviennent dans tous les domaines économiques, de l'ingénierie informatique aux techniques de fabrication. Ces problèmes sont généralement définis comme des problèmes de prise de décision dans le but d'optimiser un ou plusieurs critères de planification. Flexible Job Shop Scheduling Problem (FJSSP) est une extension du problème de planification classique de l'atelier de travail qui permet à une opération d'être traitée par n'importe quelle machine d'un ensemble donné. Il est plus complexe que le problème de planification de l'atelier, en raison de la nécessité supplémentaire de déterminer l'affectation des opérations aux machines. FJSSP est très important dans les deux domaines de la gestion de la production et de l'optimisation combinatoire. En raison de la grande complexité de calcul, il est assez difficile d'obtenir une solution optimale avec les techniques traditionnelles. À cet égard, des algorithmes appropriés (ou) des techniques sont nécessaires pour résoudre le FJSSP. Ce livre fournit une large connaissance de la métaheuristique avec le domaine de la planification.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783659690013
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : 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. N° de réf. du vendeur 24857124
Quantité disponible : Plus de 20 disponibles
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 104724488
Quantité disponible : 5 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783659690013
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783659690013
Quantité disponible : 1 disponible(s)
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Paperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. N° de réf. du vendeur ERICA77536596900156
Quantité disponible : 1 disponible(s)