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
Schedule generation in a dynamic job shop
TL;DR: In this article, an extension of Giffler and Thompson's algorithm (1960) is developed to create all active schedules in a dynamic job shop, and a partitioning scheme is also developed that works extremely well in reducing the number of active schedules created.
Journal ArticleDOI
A variant of time minimizing assignment problem
Shalini Arora,M. C. Puri +1 more
TL;DR: A lexi-search approach is proposed to find an optimal feasible assignment which minimizes the total time for completing all the jobs in a time minimizing assignment problem.
Journal ArticleDOI
Using an effective tabu search in interactive resources scheduling problem for LEO satellites missions
Journal ArticleDOI
Toward interactive scheduling systems for managing medical resources
Angelo Oddi,Amedeo Cesta +1 more
TL;DR: The results of a research aimed at applying constraint-based scheduling techniques to the management of medical resources are described, which offers a set of functionalities for a mixed-initiative interaction to cope with the medical resource management.
Journal ArticleDOI
A new branch-and-bound approach for the n /2/flowshop/a F +b C max flowshop scheduling problem
TL;DR: An efficient Branch-and-Bound approach is developed here to solve a two-machine flowshop scheduling problem and its results can usefully guide other heuristic techniques, such as simulated annealing, tabu search, and genetic algorithms, in finding optimal or good quality solutions to larger sized problems.