23,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
12 °P sammeln
Andere Kunden interessierten sich auch für
![Neural Network Algorithm for LDA/GSVD]( "Neural Network Algorithm for LDA/GSVD")
Neural Network Algorithm for LDA/GSVD26,99 €![Using Swarm Intelligence for Distributed Job Scheduling on the Grid]( "Using Swarm Intelligence for Distributed Job Scheduling on the Grid")
Using Swarm Intelligence for Distributed Job Scheduling on the Grid32,99 €![Hybridization of Soft Computing Techniques for Job Scheduling Problem]( "Hybridization of Soft Computing Techniques for Job Scheduling Problem")
Hybridization of Soft Computing Techniques for Job Scheduling Problem32,99 €![Job Scheduling In Grid Computing]( "Job Scheduling In Grid Computing")
Job Scheduling In Grid Computing36,99 €![ARTIFICIAL NEURAL NETWORKS]( "ARTIFICIAL NEURAL NETWORKS")
ARTIFICIAL NEURAL NETWORKS29,99 €![Matching Job Requirements]( "Matching Job Requirements")
Matching Job Requirements23,99 €![Design of a Recommender System for Job Searching Using Hybrid System]( "Design of a Recommender System for Job Searching Using Hybrid System")
Design of a Recommender System for Job Searching Using Hybrid System26,99 €
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.