Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
Intelligent Information Management 2011, Jan, 3, 1
-
- £2.99
-
- £2.99
Publisher Description
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.
Intelligent Information Access
2008
Design and Control of Intelligent Robotic Systems
2007
Scheduling for Parallel Processing
2010
Internet of Things and Inter-cooperative Computational Technologies for Collective Intelligence
2009
Parallel Computing
2020
Do-All Computing in Distributed Systems
2007
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
2010
How to Make Highly Rational Use of Modern Educational Technologies (Report)
2010
Data Mining Technology Across Academic Disciplines (Report)
2011
Design and Implementation of the Image Interactive System Based on Human-Computer Interaction (Report)
2010
Secure Signature Protocol (Report)
2009
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines.
2010