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
Multi-level production scheduling for a class of flexible machining and assembly systems
TL;DR: A class of machining and assembly systems characterised by a flat assembly component structure, the existence of families of similar items, non-negligible setups and fast material flow between work-centres is considered, and a hierarchical production scheduling framework is proposed.
Proceedings ArticleDOI
A PN-based scheduler for a flexible semiconductor manufacturing system
TL;DR: In this article, an approach to scheduling in a flexible semiconductor manufacturing system is described, which uses off-line scheduling as a basis for managing activities but integrates it with online scheduling whenever a modification in operating conditions requires a change in the scheduling previously drawn up.
Posted Content
Project scheduling with discrete time-resource and resource-resource tradeoffs
TL;DR: The solution procedure presented is a considerable generalization of the branch-and-bound algorithm proposed by Demeulemeester and Herroelen, which is currently the most powerful method for optimally solving the RCPSP.
Journal ArticleDOI
Attention & Interruption Management for Systems Design - A Research Overview
TL;DR: This paper identified 482 articles on the attention phenomenon published since the 1920s and structured and organized these into one framework and provided one consistent terminology on which scholars may consider to continue their future work in the field.
Journal ArticleDOI
Local search procedures for improving feasible solutions to the sequential ordering problem
TL;DR: An approximate algorithm is presented based on two local searchκ-opt procedures to reduce the makespan while satisfying the time window (i.e. release date and deadline) and precedence constraints, forκ=3 and 4.