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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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)
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Paperback. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G3659947776I3N00
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: 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 ref. del artículo: 9783659947773
Cantidad disponible: 2 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 88 pages. 8.66x5.91x0.20 inches. In Stock. Nº de ref. del artículo: 3659947776
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Nº de ref. del artículo: 158249170
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: 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 ref. del artículo: 9783659947773
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: 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 ref. del artículo: 9783659947773
Cantidad disponible: 1 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: 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 ref. del artículo: 103016783
Cantidad disponible: 5 disponibles