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
Proceedings ArticleDOI
Application of search methods to scheduling problem in plastics forming plant: a binary representation approach
TL;DR: A scheduling problem in a plastics forming plant is studied, and a method to solve them without relying upon dispatching rules is proposed, which can give satisfactory solutions to the considered scheduling problem.
Journal ArticleDOI
Job-shop scheduling: limits of the binary disjunctive formulation
K. Preston White,Ralph V. Rogers +1 more
TL;DR: It is shown that the underlying binary-disjunctive formulation itself is more robust than might be immediately apparent, and straightforward extensions of the underlying model are sufficient to capture such practical problem features as assembly and disassembly sequences, due-dates and out-processing operations, scheduled maintenance, nonzero release times and dispatch operations, and a great range of operational side-constraints.
Journal ArticleDOI
Designing an assembly line for modular products
David He,Andrew Kusiak +1 more
TL;DR: In this paper, an approach for the design of assembly lines for modular products is proposed, where the assembly line is divided into two subassembly lines: a basic assembly line for basic assembly operations and a subassembly line for variant assembly operations.
Journal ArticleDOI
A simulated annealing approach for the one-machine mean tardiness scheduling problem
Mohamed Ben-Daya,M.A. Al-Fawzan +1 more
TL;DR: The results of a simulation experiment indicate that the proposed annealing approach for solving the single machine mean tardiness scheduling problem provides much better solutions than two heuristics that gave good results in previous studies.
Journal ArticleDOI
An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
TL;DR: The proposed approach converts breakdowns scheduling problems into a finite sequence of without-breakdowns problems, and considers random variables, which measure the length of availability periods and repair times, to study availability intervals of machines.