Simulation for manufacturing system design and operation: Literature review and analysis

Data driven production modeling and simulation of complex automobile general assembly plant

How to model and implement connections between physical and virtual models for digital twin application

A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times

Cloud manufacturing (CMfg) is a service-oriented manufacturing mode and provides customers with on-demand manufacturing services via network. To solve the task scheduling problem in the dynamic CMf...

An event-triggered dynamic scheduling method for randomly arriving tasks in cloud manufacturing

Proposed in the paper is an object-oriented modelling OOM framework, called a JR-net modelling framework, for automated manufacturing system AMS design. The proposed modelling framework, which consists of a graphical modelling tool called JR-net job resource relation-net and a modelling building procedure, is the same as the current practice of AMS design and is based on the OOM paradigm. In other words, a virtual prototype of AMS is constructed step-by-step based on a three-phase modelling approach: Static layout modelling object model ; job flow modelling functional JR-net model ; supervisory control modelling dynamic model . A functional JR-net model is a directed graph in which the standard resources of an AMS become nodes and job transfers among the resources become the arcs of the graph. A complete dynamic JR-net model is obtained by specifying supervisory control requirements using tokens in the functional JR-net model. The usefulness of the proposed OOM framework is demonstrated by applying it to ...

An object-oriented modelling framework for automated manufacturing system

This paper presents an extensive performance analysis of dispatching rules for dynamic scheduling in one-of-a-kind production (OKP) where each job has its own due-date and multilevel routing structure. For the analysis, a framework of dynamic dispatching rules is proposed to identify five dispatching rules: job due-date (JDD) rule, normalized JDD rule, latest finish date (LFD) rule, latest start date (LSD) rule, and refined LSD rule. The performance analysis shows that: (i) JDD, LFD and LSD rules perform fairly well, which is compatible with the results of existing studies; (ii) the refined LSD rule outperforms other rules; (iii) the normalized JDD rule performs very poorly. Also presented is a framework of simulation-based dynamic scheduling in which the refined LSD as well as the ‘try-every-rule’ approach can be effectively utilized.

Dispatching rules for dynamic scheduling of one-of-a-kind production

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.

Workflow-based dynamic scheduling of job shop operations

Mediator approach to direct workflow simulation

This paper addresses finite-capacity planning (or medium-term scheduling) issues in a flexible flow line such as a semiconductor fabrication (Fab), liquid crystal display (LCD) Fab, or printed circuit board (PCB) Fab. In such a flexible flow line, medium-term schedules such as release schedules and output schedules are critical to achieving the goal of full-capacity and on-time production. However, existing finite-capacity planning methods do not adequately reflect the actual capacity profiles of the Fab. This paper presents capacity-filtering algorithms for generating a finite-capacity loading-profile from an infinite-capacity loading-profile at a processing stage in a Fab. In addition, two types of finite-capacity planning problems are described, and ways to use the algorithms in solving these problems presented. Performance analyses using a real-life case study show that the proposed method is superior to existing methods. It is postulated that the results presented can be used as a building block for ...

Byoung Kyu Choi

Papers

An object-oriented modelling framework for automated manufacturing system

Dispatching rules for dynamic scheduling of one-of-a-kind production

Workflow-based dynamic scheduling of job shop operations

Mediator approach to direct workflow simulation

Capacity-filtering algorithms for finite-capacity planning of a flexible flow line