Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
Intelligent Information Management 2011, Jan, 3, 1
-
- US$5.99
-
- US$5.99
출판사 설명
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.
장르
컴퓨터 및 인터넷
출시일
2011년
1월 1일
언어
EN
영어
길이
31
페이지
출판사
Scientific Research Publishing, Inc.
판매자
The Gale Group, Inc., a Delaware corporation and an affiliate of Cengage Learning, Inc.
크기
234.2
KB
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년
Euro-Par 2021: Parallel Processing
2021년
Parallel Computing
2020년
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)
2010년
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년