A new class of greedy heuristics for job shop scheduling problems

被引：0
作者：
Pranzo, M
Meloni, C
Pacciarelli, D
机构：
[1] Univ Rome Tre, Dipartimento Informat & Automaz, I-00146 Rome, Italy
[2] Politecn Bari, Dipartimento Elettrotecn & Elettron, I-70125 Bari, Italy
来源：
EXPERIMENTAL AND EFFICIENCT ALGORITHMS, PROCEEDINGS | 2003年 / 2647卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we introduce a new class of greedy heuristics for general job shop scheduling problems. In particular we deal with the classical job shop, i.e. with unlimited capacity buffer, and job shop problems with blocking and no-wait. The proposed algorithm family is a simple randomized greedy family based on a general formulation of the job shop problem. We report on an extensive study of the proposed algorithms, and comparisons with other greedy algorithms axe presented.
引用
收藏
页码：223 / 236
页数：14
相关论文
共 50 条
[21]   An iterated greedy metaheuristic for the blocking job shop scheduling problem [J].
Pranzo, Marco ;
Pacciarelli, Dario .
JOURNAL OF HEURISTICS, 2016, 22 (04) :587-611
[22]   Dynamic heuristics for the generalized job-shop scheduling problem [J].
Ghedjati, Fatima ;
Portmann, Marie-Claude .
2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, :2562-+
[23]   Flexible job shop scheduling optimization based on neh heuristics [J].
Sang, Dapeng .
Academic Journal of Manufacturing Engineering, 2019, 17 (01) :44-50
[24]   A new adaptive neural network and heuristics hybrid approach for job-shop scheduling [J].
Yang, SX ;
Wang, DW .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (10) :955-971
[25]   JOB-SHOP SCHEDULING HEURISTICS WITH LOCAL NEIGHBORHOOD SEARCH [J].
SPACHIS, AS ;
KING, JR .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1979, 17 (06) :507-526
[26]   Heuristics for generalized shop scheduling problems based on decomposition [J].
Kruger, K ;
Sotskov, YN ;
Werner, F .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1998, 36 (11) :3013-3033
[27]   A contribution and new heuristics for open shop scheduling [J].
Naderi, B. ;
Ghomi, S. M. T. Fatemi ;
Aminnayeri, M. ;
Zandieh, M. .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (01) :213-221
[28]   Mathematical Models of Flow Shop and Job Shop Scheduling Problems [J].
Seda, Milos .
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 :122-127
[29]   Using Iterated Greedy with a New Population Approach for the Flexible Job-shop Scheduling Problem [J].
Al Aqel, G. ;
Li, X. ;
Gao, L. ;
Gong, W. ;
Wang, R. ;
Ren, T. ;
Wu, G. .
2018 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM), 2018, :1235-1239
[30]   A new genetic algorithm for flexible job-shop scheduling problems [J].
Driss, Imen ;
Mouss, Kinza Nadia ;
Laggoun, Assia .
JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY, 2015, 29 (03) :1273-1281
12345