A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling

被引：0

作者：

Laha, Dipak ^{[1
]}

机构：

[1] Jadavpur Univ, Dept Mech Engn, Kolkata, India

来源：

SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, (SEMCCO 2012) | 2012年 / 7677卷

关键词：

Parallel machine scheduling; makespan; simulated annealing; heuristic; optimization; lower bound; BATCH PROCESSING MACHINES; DEPENDENT SETUP TIMES; READY TIMES; ALGORITHM; TARDINESS; JOBS;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper deals with the problem of scheduling a set of n independent jobs to be processed on m identical parallel machines in order to minimize makespan. This problem is known to be NP-complete. A SA based heuristic is presented to solve this problem. Empirical results with a large number of randomly generated problem instances demonstrate that the proposed method produces solutions that are fairly superior to that of the best-known method in the literature while not affecting its computational effort.

引用

页码：198 / 205

页数：8

共 50 条

[1] Heuristics for Uniform Parallel Machine Scheduling Problem with Minimizing Makespan
Li, Kai
Zhang, Shu-chu
[J]. 2008 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2008, : 273 - 278
[2] Parallel machine scheduling for minimizing the makespan and the average flow-time
Ruiz-Torres, AJ
Enscore, EE
Barton, RR
[J]. 6TH INDUSTRIAL ENGINEERING RESEARCH CONFERENCE PROCEEDINGS: (IERC), 1997, : 186 - 191
[3] Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling
Bamatraf, Khaled
Gharbi, Anis
[J]. SYSTEMS, 2024, 12 (06):
[4] Minimizing makespan in batch machine scheduling
Poon, CK
Zhang, PX
[J]. ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 386 - 397
[5] Minimizing makespan in batch machine scheduling
Poon, CK
Zhang, PX
[J]. ALGORITHMICA, 2004, 39 (02) : 155 - 174
[6] Minimizing Makespan in Batch Machine Scheduling
Chung Keung Poon
Pixing Zhang
[J]. Algorithmica , 2004, 39 : 155 - 174
[7] A Job Scheduling Model and Heuristic Algorithm for Minimizing the Range of Lateness and Makespan on Parallel Machines
HUANG Decai Zhejiang University of technology
[J]. Journal of Systems Science and Systems Engineering, 1998, (01) : 51 - 56
[8] MINIMIZING MAKESPAN FOR FLOW-SHOP SCHEDULING BY COMBINING SIMULATED ANNEALING WITH SEQUENCING KNOWLEDGE
ZEGORDI, SH
ITOH, KJ
ENKAWA, T
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 85 (03) : 515 - 531
[9] MINIMIZING THE MAKESPAN OF A GROUP SCHEDULING PROBLEM - A NEW HEURISTIC
LOGENDRAN, R
NUDTASOMBOON, N
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1991, 22 (03) : 217 - 230
[10] A LISTFIT heuristic for minimizing makespan on identical parallel machines
Gupta, JND
Ruiz-Torres, J
[J]. PRODUCTION PLANNING & CONTROL, 2001, 12 (01) : 28 - 36

← 1 2 3 4 5 →