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
Parallel GRASP with path-relinking for job shop scheduling
TL;DR: Computational experience on a large set of standard test problems indicates that the parallel GRASP with path-relinking finds good-quality approximate solutions of the JSP.
Patent
Method of generating instruction sequences for controlling data flow processes
TL;DR: In this article, a set of "tasks" are defined for changing the states of multiple-state resources and causing software resources to produce output data, and a sequence of tasks are produced to control the systems so as to assure valid data collection and protect physical resources from abuse.
Journal ArticleDOI
A tabu search method guided by shifting bottleneck for the job shop scheduling problem
TL;DR: The proposed local search method is based on a tabu search technique and on the shifting bottleneck procedure used to generate the initial solution and to refine the next-current solutions.
Journal ArticleDOI
Job-Shop Scheduling Theory: What Is Relevant?
TL;DR: A preliminary field study is used to illustrate that the basic theoretical approach to scheduling does not represent the reality of open job-shop scheduling, and its applicability is limited to those situations that are fundamentally static and behave like the models.
Journal ArticleDOI
Scheduling with timed automata
TL;DR: It is shown how efficient shortest path algorithms for timed automata can find optimal schedules for the classical job-shop problem and are extended to synthesize adaptive scheduling strategies for problems with uncertainty in task durations.