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 条
[41]   A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem [J].
Al Aqel, Ghiath ;
Li, Xinyu ;
Gao, Liang .
CHINESE JOURNAL OF MECHANICAL ENGINEERING, 2019, 32 (01)
[42]   Neural networks for job shop scheduling problems [J].
Industrial Engineering Department, Faculty of Engineering, Zagazig Unversity, Egypt .
J Eng Appl Sci, 2009, 2 (169-183) :169-183
[43]   Cyclic job shop scheduling problems with blocking [J].
Brucker, Peter ;
Kampmeyer, Thomas .
ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) :161-181
[44]   A Rollout Metaheuristic for Job Shop Scheduling Problems [J].
Carlo Meloni ;
Dario Pacciarelli ;
Marco Pranzo .
Annals of Operations Research, 2004, 131 :215-235
[45]   AN INVESTIGATION OF DYNAMIC GROUP SCHEDULING HEURISTICS IN A JOB SHOP MANUFACTURING CELL [J].
MAHMOODI, F ;
DOOLEY, KJ ;
STARR, PJ .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1990, 28 (09) :1695-1711
[46]   JOB-SHOP SCHEDULING HEURISTICS FOR SEQUENCE-DEPENDENT SETUPS [J].
LOW, CY .
COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 29 :279-283
[47]   Learning Strategies on Scheduling Heuristics of Genetic Programming in Dynamic Flexible Job Shop Scheduling [J].
Zhang, Fangfang ;
Mei, Yi ;
Nguyen, Su ;
Zhang, Mengjie .
2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
[48]   A COMPREHENSIVE ANALYSIS OF GROUP SCHEDULING HEURISTICS IN A JOB-SHOP CELL [J].
RUBEN, RA ;
MOSIER, CT ;
MAHMOODI, F .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1993, 31 (06) :1343-1369
[49]   Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance? [J].
Garza-Santisteban, Fernando ;
Cruz-Duarte, Jorge Mario ;
Amaya, Ivan ;
Ortiz-Bayliss, Jose Carlos ;
Conant-Pablos, Santiago Enrique ;
Terashima-Marin, Hugo .
JOURNAL OF SCHEDULING, 2024, :85-99
[50]   Beyond Hyper-Heuristics: A Squared Hyper-Heuristic Model for Solving Job Shop Scheduling Problems [J].
Vela, Alonso ;
Cruz-Duarte, Jorge M. ;
Carlos Ortiz-Bayliss, Jose ;
Amaya, Ivan .
IEEE ACCESS, 2022, 10 :43981-44007
12345