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
Book ChapterDOI
Towards Reusable Intelligent Scheduling Software
TL;DR: A special architecture based on object-oriented application frameworks and AI-reasoning methods is proposed as a mean to narrow the gap in standard scheduling software package.
Book ChapterDOI
A Tabu Search Strategy to Solve Scheduling Problems with Deadlines and Complex Metric Constraints
Angelo Oddi,Amedeo Cesta +1 more
TL;DR: The paper proposes and experimentally evaluates a tabu search procedure to improve a previously created heuristic solution to the RMSP, and demonstrates the usefulness of the proposed approach.
Journal ArticleDOI
Experience and reflection on the development of a holonic job shop scheduling system
TL;DR: The development of a holonic job shop scheduling system that is based on Object-Oriented (O-O) and Multi-Agent Systems (MAS) approaches is described and some suggestions for the developers of the holonic systems are provided.
Journal ArticleDOI
Planung von betrieblichen Abläufen durch Standardsoftware — ein Widerspruch?
TL;DR: Theodorakopoulos et al. as discussed by the authors proposed a new algorithm, www.gestalten.gestaltten.com/bestalten-gestaltte-structure.
Book ChapterDOI
Genetic Algorithm and Particle Swarm Optimization in Minimizing MakeSpan Time in Job Shop Scheduling
K. R. Anil Kumar,Edwin Raja Das +1 more
TL;DR: Results show that PSO is found to possess minimum makespan time in comparison with GA for JSSP, in addition to the existing optimization techniques applied in various research papers on combinatorial optimization problems.