Scheduling rules for a small dynamic job-shop: a simulation approach

Industries nowadays must be able to quickly adapt with the customer and improve product quality to survive in the competitive edge. Job shop scheduling is crucial in the manufacturing world and exists within most manufacturing sectors. In the manufacturing world, scheduling problems are extensively implementing the dispatching rules. The procedures are designed to provide good solutions to complex problems in real-time. This paper describes the importance of dispatching rules in improving the performance of the factory. This study evaluates total of44dispatching rules with the classification of hybrid and single rules. The performance of each rule compared and summarized to determine the final ranking for all the different dispatching rules. The result shown that MTWR (Most Total Work Remaining) rule performs well in almost all measurements as well as hybrid dispatching rules is not generating the best rules compared to single dispatching rule. A set of data from an automotive industry use to simulate the job-shop production floor.

“…The job shop problem described as [20][21]: there are m machines with n operations and j jobs. Therefore, there will be m n possible for the allocation rules, (n!)…”

Section: Problem Statementmentioning

confidence: 99%

Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study

Kaban

Othman

Rohmah

2012

“…A dispatching rule dynamically determines a WIP (Work-In-Process) lot to be processed next once a machine becomes available. Currently, most of the dispatching rules are variants of classical rules like Operation due date (ODD), Earliest due date (EDD), and Critical Ratio (CR), and these rules is often used in an attempt to optimize the on-time delivery [12][13][14][15][16][17][18][19]. Although there have been various dispatching rules for on-time delivery, still FABs have great difficulties to achieve the on-time delivery.…”

Section: Introductionmentioning

confidence: 99%

On-Time Delivery Achievement of High Priority Orders in Order-Driven Fabrications

Seo¹,

Chung²,

Park³

2015

This paper proposes a new dispatching rule to achieve the on-time delivery of high priority lots in order-driven fabrications (FABs). Most of conventional dispatching rules can be considered as the variants of classical rules like ODD, EDD, and CR. Although, many of conventional dispatching rules give good performance in terms of the on-time delivery, they do not consider the existence of high priority lots. We classify orders into two types for an order-driven FAB; regular orders and high priority orders. While regular orders are typically characterized by longer cycle times, looser target due dates but lower margins, the high priority orders have shorter cycle times, tighter target due dates and higher margins. If the deliveries of high priority orders are late, the manufacturer may have to pay a significant amount of penalty charges. The proposed dispatching rule employs the concept of reservations of high priority lots, and consists of two major steps; 1) finding a high priority lot for reservation, and 2) finding a tool for reservation. The first step tries to minimize the waiting time of high priority lots, and the second step tries to maximize the utilization of tools. Experimental results show that the proposed dispatching rule is superior over conventional rules with regard to on-time delivery of high priority lots.

“…In a job-shop scheduling system, expert systems that are presented for production problems are the interruption of machines, re-work, and work-in-process by the simulation tool or the development of a framework for minimizing makespan, considering due dates, priorities, dispatching rules, and maintenance control processes. During the process of simulation, some assignments are applied between resources and operations [36][37][38][39][40][41][42][43][44][45].…”

Section: Introductionmentioning

confidence: 99%

A New Production Scheduling Module Using Priority-Rule Based Genetic Algorithm

Aydemir¹,

Koruca²

2015

Production scheduling is an important function that determines the efficiency and productivity of a production system. Many optimization methods, techniques, tools, and heuristics have been used to solve production scheduling problems, accordingly priority rules are implemented for customers' orders in real-world applications. Simulations and heuristic methods are quite useful for making decisions, and they are used mostly to design and improve production systems by reducing their complexity. In this study, a Priority Rule-Based Genetic Algorithm Scheduling (PRGA-Sched) module was developed to provide shorter total completion time in production scheduling. The module was integrated with the Faborg-Sim simulation tool. As a case study, a heating boiler manufacturing system was analyzed and simulated with six products and customers' orders by using production data from the PRGA-Sched module in Faborg-Sim. The results showed that a shorter total completion time is obtained and saved than the initial situation by via PRGA-Sched module.