Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report) Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report)

Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report‪)‬

Intelligent Information Management 2011, Jan, 3, 1

Intelligent Information Management
    • $5.99
    • $5.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.

GENRE
Computers & Internet
RELEASED
2011
January 1
LANGUAGE
EN
English
LENGTH
31
Pages
PUBLISHER
Scientific Research Publishing, Inc.
SELLER
The Gale Group, Inc., a Delaware corporation and an affiliate of Cengage Learning, Inc.
SIZE
234.2
KB

More Books Like This

Intelligent Information Access Intelligent Information Access
Intelligent Information Access
2008
Design and Control of Intelligent Robotic Systems Design and Control of Intelligent Robotic Systems
Design and Control of Intelligent Robotic Systems
2007
Scheduling for Parallel Processing Scheduling for Parallel Processing
Scheduling for Parallel Processing
2010
Internet of Things and Inter-cooperative Computational Technologies for Collective Intelligence Internet of Things and Inter-cooperative Computational Technologies for Collective Intelligence
Internet of Things and Inter-cooperative Computational Technologies for Collective Intelligence
2009
Euro-Par 2021: Parallel Processing Euro-Par 2021: Parallel Processing
Euro-Par 2021: Parallel Processing
2021
Parallel Computing Parallel Computing
Parallel Computing
2020

More Books by Intelligent Information Management

Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines. Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines.
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines.
2010
Policy Research in a Complex Context (Report) Policy Research in a Complex Context (Report)
Policy Research in a Complex Context (Report)
2010
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines (Report) Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
2010
How to Make Highly Rational Use of Modern Educational Technologies (Report) How to Make Highly Rational Use of Modern Educational Technologies (Report)
How to Make Highly Rational Use of Modern Educational Technologies (Report)
2010
Data Mining Technology Across Academic Disciplines (Report) Data Mining Technology Across Academic Disciplines (Report)
Data Mining Technology Across Academic Disciplines (Report)
2011
Design and Implementation of the Image Interactive System Based on Human-Computer Interaction (Report) Design and Implementation of the Image Interactive System Based on Human-Computer Interaction (Report)
Design and Implementation of the Image Interactive System Based on Human-Computer Interaction (Report)
2010