A survey of approaches to the job shop scheduling problem

Authors:
D. W. Sellers
Affiliations:
-
Venue:
SSST '96 Proceedings of the 28th Southeastern Symposium on System Theory (SSST '96)
Year:
1996

Citing 0
Cited 3

Factory scheduling: simulation-based finite scheduling at Albany International

Proceedings of the 35th conference on Winter simulation: driving innovation
A branch, bound, and remember algorithm for the 1|ri|Σti scheduling problem

Journal of Scheduling
New dominance rules and exploration strategies for the 1|ri|ΣUi scheduling problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a brief introduction to the three primary directions of research in job shop scheduling. These areas are heuristic rules, classical optimization methods, and neural network approaches. The primary purpose is to provide a starting point for researchers who are interested in this area, so there is a focus on references to helpful technical papers in each of these areas of research.