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
A Petri net based approach to modeling and scheduling for an FMS and a case study
TL;DR: A timed-place Petri net model for flexible manufacturing systems (FMSs) is constructed, which contains two major submodels: the stationary transportation model; and the variable process flow model, and an effective schedule of the part processing can be obtained by using an A/sup based search algorithm.
Exploiting Problem Structure for Distributed Constraint Optimization.
Jyi-Shane Liu,Katia Sycara +1 more
TL;DR: This work presents a coordination mechanism, Anchor&Ascend, for distributed constraint optimization that takes advantage of disparity among subpmblems to efficiently guide distributed local search for global optimality.
Journal ArticleDOI
Mixed binary integer programming formulations for the reentrant job shop scheduling problem
TL;DR: Two extended BIP optimization formulations for the reentrant job shop scheduling problem are presented and two layer division procedures are developed and incorporated in the corresponding models in order to improve the solution speed.
Proceedings Article
Job-shop scheduling with genetic programming
TL;DR: This research proposes an approach for synthesizing the dispatching rule by means of Genetic Programming (GP) and gets the results showing that GP-based multi-agent dispatching scheduler outperformed the well-known dispatching rules.
Journal ArticleDOI
A new lower bound for the open‐shop problem
TL;DR: A new lower bound for the open‐shop problem is presented, at least as good as LB and improves ittypically by 4%, which is remarkable for a shop problem known for its rather small gaps between LB and the optimal makespan.