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
Makespan distributions in flow shop scheduling
James Caffrey,Graham Hitchings +1 more
TL;DR: The distribution of makespans and the distribution of the optimal makesPans was obtained by complete enumeration of all the schedules and three priority rules were evaluated as to their performance on minimizing the makespan.
Journal ArticleDOI
Efficient calculation of the makespan for job-shop systems without recirculation using max-plus algebra
Manjeet Singh,Robert P. Judd +1 more
TL;DR: In this article, max-plus algebraic techniques are used to develop an efficient method to calculate the makespan of a perturbed job-shop manufacturing system, where the perturbations in schedule are confined to a particular sub-system which is termed the variant and the rest of the system is called the invariant.
On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops
TL;DR: In this article, a stochastic job shop problem was solved using two genetic algorithms: a deterministic constrained and unconstrained genetic algorithm to minimize makespan, and a deterministically constrained genetic algorithm for minimizing total tardiness.
Journal ArticleDOI
Some metaheuristic approaches for optimising tardiness of job and tool in a flexible manufacturing system
TL;DR: Non-traditional optimisation algorithms such as genetic algorithm, SA algorithm, ACO algorithm and PSO algorithm are proposed to derive near optimal solutions which adopt the extended Giffler and Thompson algorithm for active schedule generation for FMS.
Journal ArticleDOI
One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
TL;DR: Two different pseudo polynomial dynamic programming recursions for each of the open shop and flow shop case are discussed, some of the running times are better than those of the best known algorithms in the literature.