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
Job shop scheduling by local search
TL;DR: In this paper, the authors present a computational performance analysis of local search algorithms for job shop scheduling, including iterative improvement, simulated annealing, threshold accepting and genetic local search.
Journal ArticleDOI
Adjustment of heads and tails for the job-shop problem
Jacques Carlier,Eric Pinson +1 more
TL;DR: A new lower bound and a new branching scheme which are used to design a branch and bound method are described and Computational results show that these techniques permit to drastically reduce the size of the search trees.
Journal ArticleDOI
Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons
TL;DR: This paper examines recent developments in the field of evolutionary computation for manufacturing optimization with a wide range of problems, from job shop and flow shop scheduling, to process planning and assembly line balancing.
Journal ArticleDOI
Analysis of periodic and event-driven rescheduling policies in dynamic shops
Laura K. Church,Reha Uzsoy +1 more
TL;DR: In this paper, the authors address the problem of rescheduling production systems in the face of dynamic job arrivals using simple single-and parallel-machine models to gain insight, and provide worst-case and computational analyses of periodic and event-driven scheduling policies.
Journal ArticleDOI
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
TL;DR: A fast and simple priority dispatch method is described and shown to produce acceptable schedules most of the time and a look ahead algorithm is introduced that outperforms the dispatcher by about 12% with only a small increase in run time.