A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem

被引：0
|
作者：
Fernandes, Susana [1 ]
Lourenco, Helena R. [2 ]
机构：
[1] Univ Algarve, Faro, Portugal
[2] Univ Pompeu Fabra, Barcelona, Spain
来源：
RECENT ADVANCES IN EVOLUTIONARY COMPUTATION FOR COMBINATORIAL OPTIMIZATION | 2008年 / 153卷
关键词：
Job-Shop Scheduling; Hybrid Metaheuristic; Optimised Search Heuristics; GRASP; Exact Methods;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.
引用
收藏
页码：203 / +
页数：2
相关论文
共 50 条
  • [31] The generalized flexible job shop scheduling problem
    Boyer, Vincent
    Vallikavungal, Jobish
    Cantu Rodriguez, Xavier
    Angelica Salazar-Aguilar, M.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 160
  • [32] A Taxonomy for the Flexible Job Shop Scheduling Problem
    Cinar, Didem
    Topcu, Y. Ilker
    Oliveira, Jose Antonio
    OPTIMIZATION, CONTROL, AND APPLICATIONS IN THE INFORMATION AGE: IN HONOR OF PANOS M. PARDALOS'S 60TH BIRTHDAY, 2015, 130 : 17 - 37
  • [33] A heuristic algorithm based on Tabu Search for the solution of Flexible Job Shop Scheduling Problems with Lot Streaming
    Fernandez Romero, Miguel A.
    Rincon Garcia, Eric A.
    Ponsich, Antonin
    Mora Gutierrez, Roman A.
    GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, : 285 - 292
  • [34] A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic
    Raeesi N, Mohammad R.
    Kobti, Ziad
    MEMETIC COMPUTING, 2012, 4 (03) : 231 - 245
  • [35] A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
    Escamilla Serna, Nayeli Jazmin
    Carlos Seck-Tuoh-Mora, Juan
    Medina-Marin, Joselito
    Hernandez-Romero, Norberto
    Barragan-Vite, Irving
    Corona Armenta, Jose Ramon
    PEERJ COMPUTER SCIENCE, 2021,
  • [36] Multi-strategy improved sparrow search algorithm for job shop scheduling problem
    Li, Zhengfeng
    Zhao, Changchun
    Zhang, Guohui
    Zhu, Donglin
    Cui, Lujun
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (04): : 4605 - 4619
  • [37] A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic
    Mohammad R. Raeesi N.
    Ziad Kobti
    Memetic Computing, 2012, 4 : 231 - 245
  • [38] Improved tabu search approach for solving the job shop scheduling problem with tooling constraints
    Hertz, A
    Widmer, M
    DISCRETE APPLIED MATHEMATICS, 1996, 65 (1-3) : 319 - 345
  • [39] A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
    Nagata, Yuichi
    Ono, Isao
    COMPUTERS & OPERATIONS RESEARCH, 2018, 90 : 60 - 71
  • [40] A Global-local Neighborhood Search Algorithm and Tabu Search for Flexible Job Shop Scheduling Problem
    Serna N.J.E.
    Seck-Tuoh-Mora J.C.
    Medina-Marin J.
    Hernandez-Romero N.
    Barragan-Vite I.
    Armenta J.R.C.
    PeerJ Computer Science, 2021, 7 : 1 - 32
12345