A new class of greedy heuristics for job shop scheduling problems

Authors:
Marco Pranzo;Carlo Meloni;Dario Pacciarelli
Affiliations:
Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, Roma, Italy;Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari, Bari, Italy;Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, Roma, Italy
Venue:
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Year:
2003

Citing 6
Cited 1

The shifting bottleneck procedure for job shop scheduling

Management Science
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
Insertion techniques for the heuristic solution of the job shop problem

Proceedings of the workshop on Discrete algorithms
A fast taboo search algorithm for the job shop problem

Management Science
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Dispatching and coordination in multi-area railway traffic management

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 are presented.