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
Evolution based learning in a job shop scheduling environment
Ulrich Dorndorf,Erwin Pesch +1 more
TL;DR: A class of approximation algorithms is described for solving the minimum makespan problem of job shop scheduling and can find shorter makespans than the shifting bottleneck heuristic or a simulated annealing approach with the same running time.
Journal ArticleDOI
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Egon Balas,Alkis Vazacopoulos +1 more
TL;DR: A hybrid procedure that embeds GLS (Guided Local Search) into a Shifting Bottleneck framework and takes advantage of the differences between the two neighborhood structures proves to be particularly efficient.
Journal ArticleDOI
Scheduling a single batch processing machine with non-identical job sizes
TL;DR: In this paper, the problem of scheduling jobs with non-identical capacity requirements or sizes on a single batch processing machine to minimize total completion time and makespan is studied, and heuristics are developed for both problems.
Book ChapterDOI
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
TL;DR: This work focuses on deterministic machine scheduling for which it is assumed that all data that define a problem instance are known with certainty.
Journal ArticleDOI
Multi‐objective combinatorial optimization problems: A survey
E. L. Ulungu,Jacques Teghem +1 more
TL;DR: The present paper is intended to review the existing literature on multi-objective combinatorial optimization (MOCO) problems and examines various classical combinatorials problems in a multi-criteria framework.