Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
Intelligent Information Management 2011, Jan, 3, 1
-
- 5٫99 US$
-
- 5٫99 US$
وصف الناشر
1. Introduction The single machine scheduling problem is classified into single machine scheduling with single machine and single machine scheduling problem with parallel machines. The single machine scheduling problem with single machine consists of n independent jobs, each with single and same operations. The single machine scheduling with parallel machines is further classified into the following three categories.
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines.
٢٠١٠
Policy Research in a Complex Context (Report)
٢٠١٠
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
٢٠١٠
How to Make Highly Rational Use of Modern Educational Technologies (Report)
٢٠١٠
Data Mining Technology Across Academic Disciplines (Report)
٢٠١١
Design and Implementation of the Image Interactive System Based on Human-Computer Interaction (Report)
٢٠١٠