Genetic Local Search Algorithm for minimizing the total completion time in single machine scheduling problem with release dates and precedence constraints

被引：0

作者：

Zaidi, Ichraf ^{[1
]}

Mrad, Mehdi

Ladhari, Talel ^{[1
]}

机构：

[1] Univ Tunis, Tunis, Tunisia

来源：

2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO) | 2013年

关键词：

TOTAL FLOW TIME; READY TIMES; HEURISTICS; JOBS;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this work we investigate the single machine scheduling problem with release dates and precedence constraints for minimizing the sum of completion times. To solve this problem approximately, we propose three constructive heuristics as well as a genetic local search algorithm. Computational results show that the proposed genetic local search algorithm yields near-optimal solutions and provides interesting results.

引用

页数：4

共 50 条

[1] Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
Rakrouki, Mohamed Ali
Ladhari, Talel
T'kindt, Vincent
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (06) : 1257 - 1264
[2] On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
Ng, CT
Cheng, TCE
Yuan, JJ
Liu, ZH
OPERATIONS RESEARCH LETTERS, 2003, 31 (04) : 323 - 326
[3] Minimizing Total Completion Time for Preemptive Scheduling with Release Dates and Deadline Constraints
He, Cheng
Lin, Hao
Lin, Yixun
Dou, Junmei
FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2014, 39 (01) : 17 - 26
[4] Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
Eren, Tamer
APPLIED MATHEMATICS AND COMPUTATION, 2009, 208 (02) : 355 - 358
[5] Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
Wu, Chin-Chia
Hsu, Peng-Hsiang
Chen, Juei-Chao
Wang, Nae-Sheng
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (07) : 1025 - 1034
[6] A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Skutella, Martin
OPERATIONS RESEARCH LETTERS, 2016, 44 (05) : 676 - 679
[7] A (2+ε)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Sitters, Rene
Yang, Liya
OPERATIONS RESEARCH LETTERS, 2018, 46 (04) : 438 - 442
[8] Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
Nessah, Rabia
Kacem, Imed
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 471 - 478
[9] Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
Chand, S
Traub, R
Uzsoy, R
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) : 115 - 125
[10] Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
Suresh Chand
Rodney Traub
Reha Uzsoy
Annals of Operations Research, 1997, 70 : 115 - 125

← 1 2 3 4 5 →