Order release planning in a job shop using a bi-directional simulation algorithm
WSC '94 Proceedings of the 26th conference on Winter simulation
A backward approach in list scheduling algorithms for multi-machine tardiness problems
Computers and Operations Research
A fast finite loading algorithm for job oriented scheduling
Computers and Operations Research
Integration of workflow management and simulation
Computers and Industrial Engineering
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Theory of Modeling and Simulation
Theory of Modeling and Simulation
A simulation-based decision support system for business process planning
Fuzzy Sets and Systems - Theme: Decision and optimization
Semantical Considerations on Workflows: An Algebra for Intertask Dependencies
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Dynamic rescheduling that simultaneously considers efficiency and stability
Computers and Industrial Engineering
An architecture for workflow scheduling under resource allocation constraints
Information Systems
Enhancing business process management with simulation optimization
Proceedings of the 38th conference on Winter simulation
Hi-index | 0.00 |
In a job shop such as a mould-making shop, dispatching decisions as to which job should be loaded on a machine when it becomes free are termed dynamic scheduling. A practical approach to dynamic job-shop scheduling is the use of discrete event simulation, and their dedicated simulation-based dynamic scheduling systems, often known as manufacturing execution systems or advanced planning systems, are available. In the present paper, we propose a workflow-based dynamic scheduling framework, in which a workflow management system (WfMS) serves as a dynamic job-shop scheduler. For this purpose, we have developed an algorithm for embedding a discrete-event simulation mechanism into a WfMS, and have implemented a prototype job-shop scheduler. Illustrative performance evaluation shows that the proposed framework is logically valid and computationally efficient.