A constructive heuristic for solving the Job-Shop Scheduling Problem

Rafael Mellado Silva, Claudio Cubillos, Daniel Cabrera Paniagua

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This work proposes the use of a constructive heuristic called Shifting Bottleneck Procedure for solving the Job-Shop Scheduling problem, with the aim to minimize the makespan, that is, the final delay of production planning. Because the constructive heuristic delivers an initial solution, then a Tabu Search method was used, with the aim to obtain a planification with the lowest possible makespan. The proposal was tested using benchmark data, and the results are promising, because the obtention of initial solutions using a constructive heuristic allows to decrease the processing time, and usually, the final results obtained from Tabu Search method are better.

Original languageEnglish
Article number7555250
Pages (from-to)2758-2763
Number of pages6
JournalIEEE Latin America Transactions
Volume14
Issue number6
DOIs
StatePublished - Jun 2016
Externally publishedYes

Keywords

  • Job Shop Scheduling
  • Tabu search
  • constructive heuristic

Fingerprint

Dive into the research topics of 'A constructive heuristic for solving the Job-Shop Scheduling Problem'. Together they form a unique fingerprint.

Cite this