Open AccessBook
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
Reads0
Chats0
TLDR
In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.Abstract:
(1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Journal of the Operational Research Society: Vol. 33, No. 9, pp. 862-862.read more
Citations
More filters
Journal ArticleDOI
Optimization models for the machine scheduling problem with a single flexible maintenance activity
TL;DR: This study addresses the single machine and parallel machine scheduling problems, where machines are flexibly maintained and total tardiness is used as a performance measure.
Journal ArticleDOI
An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling
TL;DR: A local search heuristic, based on an extension of the 1956 graphical method of Akers, is applied to improve the solution of the job-shop scheduling problem and its application within a biased random-key genetic algorithm is presented.
Journal ArticleDOI
Taxonomy of scheduling systems as a basis for the study of strategic behavior
TL;DR: This work introduces the concepts and terminology of scheduling theory and shows how these can be identified with aspects of human operator behavior and can provide a systematic conceptual framework for planning research on behavior in complex human-machine settings, both in and beyond laboratory contexts.
Dissertation
Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation
TL;DR: In this paper, the authors introduce a method, called Dynasearch, of constructing new neighbourhoods, and of viewing some previously derived exponentially sized neighbourhoods which are searchable in polynomial time.
Journal ArticleDOI
Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling
TL;DR: Classic methods are compared to the most recent MMGAs, grouped in three classes (sharing, clearing and species competition), for JSSP, and it is found that those new M MGAs which have a certain type of replacement process perform much better than classical MMG as which do not have this type of process.