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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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)
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Codice articolo G3659947776I3N00
Quantità: 1 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783659947773
Quantità: 2 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 88 pages. 8.66x5.91x0.20 inches. In Stock. Codice articolo 3659947776
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Condizione: New. Codice articolo 158249170
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783659947773
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783659947773
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: 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. Codice articolo 103016783
Quantità: 5 disponibili