Job-shop scheduling is the allocation of machines over time to perform a collection of jobs to minimize/maximize a specific performance measure while satisfying the operation precedence constraints, machine capacity constraints, processing time and ready time requirements, and the resources are machines and jobs. Job-shop scheduling belongs to the class of NP-complete problems. In this Book, for solving NP-complete problem Artificial neural network models have been applied. The main objective is to minimize the total weighted completion time of the jobs in the system that is the minimization of the makespan (Time needed to complete all jobs) time by using the heuristic method, which gives a high quality approximate solution in reasonable time.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Rukhsana G.Sache Assist. Prof., CSE Dept. SVERI’s College of Engg., Pandharpur (413304) ME(CSE), BE(CSE), Sanjivani S. Kadam Assist. Prof., CSE Dept. SVERI’s College of Engg., Pandharpur (413304) ME(CSE), BE(CSE), Rajani R. Mhetre Assist. Prof., ENTC Dept. SVERI’s College of Engg., Pandharpur (413304) ME(ENTC), BE(ENTC)
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G3659947776I3N00
Quantité disponible : 1 disponible(s)
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 -Job-shop scheduling is the allocation of machines over time to perform a collection of jobs to minimize/maximize a specific performance measure while satisfying the operation precedence constraints, machine capacity constraints, processing time and ready time requirements, and the resources are machines and jobs. Job-shop scheduling belongs to the class of NP-complete problems. In this Book, for solving NP-complete problem Artificial neural network models have been applied. The main objective is to minimize the total weighted completion time of the jobs in the system that is the minimization of the makespan (Time needed to complete all jobs) time by using the heuristic method, which gives a high quality approximate solution in reasonable time. 88 pp. Englisch. N° de réf. du vendeur 9783659947773
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 88 pages. 8.66x5.91x0.20 inches. In Stock. N° de réf. du vendeur 3659947776
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. N° de réf. du vendeur 158249170
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Job-shop scheduling is the allocation of machines over time to perform a collection of jobs to minimize/maximize a specific performance measure while satisfying the operation precedence constraints, machine capacity constraints, processing time and ready time requirements, and the resources are machines and jobs. Job-shop scheduling belongs to the class of NP-complete problems. In this Book, for solving NP-complete problem Artificial neural network models have been applied. The main objective is to minimize the total weighted completion time of the jobs in the system that is the minimization of the makespan (Time needed to complete all jobs) time by using the heuristic method, which gives a high quality approximate solution in reasonable time.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 88 pp. Englisch. N° de réf. du vendeur 9783659947773
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Job-shop scheduling is the allocation of machines over time to perform a collection of jobs to minimize/maximize a specific performance measure while satisfying the operation precedence constraints, machine capacity constraints, processing time and ready time requirements, and the resources are machines and jobs. Job-shop scheduling belongs to the class of NP-complete problems. In this Book, for solving NP-complete problem Artificial neural network models have been applied. The main objective is to minimize the total weighted completion time of the jobs in the system that is the minimization of the makespan (Time needed to complete all jobs) time by using the heuristic method, which gives a high quality approximate solution in reasonable time. N° de réf. du vendeur 9783659947773
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Job Shop Scheduling Using Neural Network | Rukhsana Sache (u. a.) | Taschenbuch | 88 S. | Englisch | 2016 | LAP LAMBERT Academic Publishing | EAN 9783659947773 | 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 103016783
Quantité disponible : 5 disponible(s)