Customer Order Scheduling in a General Job Shop Environment
Dilip Chhajed1998, Decision Sciences
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
The primary objective of this study is to examine the performance of order-based dispatching rules in a general job shop, where the environmental factors are shop utilization and due date tightness. An order is defined as a collection of jobs that are shipped as a g r o u p a n order-to the customer, only on completion of the last job of the order. We specifically compare dispatching rules from past job-based studies to some rules adapted to encompass order characteristics. Standard flow time and tardiness measures are used, but in addition, we introduce measures that combine average performance with variation in an attempt to capture the performance of a majority of the orders processed in the shop. Of the 16 dispatching ruies tested, our results show that four of the simple rules dominate the others. We also found that order-based rules perform better than their job-based counterparts. The study makes use of multivariate statistical analysis, in addition to the usual univariate tests, which can provide additional insight to managers using multiple criteria in their decision process.
Related papers
Using order routing specific flow time and workload information to improve lead time and due date performance in job shops
Knowledge, Technology & Policy, 2003
Using order routing specific flow time and workload information to improve lead time and due date performance in job shops. (BETA publicatie : working papers; Vol.
Due Date Assignment, Job Order Release, and Sequencing Interaction in Job Shop Scheduling
Decision Sciences, 1992
Depending on the techniques employed, the due date assignment, release, and sequencing procedures in job shop scheduling may depend on one another. This research investigates the effects of these interactions with a simulation model of a dynamic five-machine job shop in which early shipments are prohibited. Performance of the system is measured primarily in terms of the total cost (work-in-process cost, finished goods holding cost, and late penalty) incurred by the shop, but a number of non-cost performance measures are also reported. The results support existence of a three-way interaction between the due date, release, and sequencing procedures as well as interaction between shop utilization and procedure combination. Statistical tests are used to identify those rules that perform best both overall and in combination with other ~1~s .
New dispatching rules to minimize rejection and tardiness costs in a dynamic flexible flow shop
The International Journal of Advanced Manufacturing Technology, 2009
This paper studies a flexible flow shop system considering dynamic arrival of jobs and the ability of acceptance and rejection of new jobs. The problem objective is to determine a schedule that minimizes sum of the tardiness and rejection costs of jobs. A 0-1 mixed integer model of the problem is formulated. Since this problem class is NP-hard, four dispatching rules have been developed to solve the problem approximately. Moreover, a discrete event simulation model of the flexible flow shop system is developed for the purpose of experimentation. Four dispatching rules from the literature and four new dispatching rules proposed in this paper are incorporated in the simulation model. Simulation experiments have been conducted under various experimental conditions characterized by factors such as shop utilization level, due date tightness and number of stages in flexible flow shop. The results indicate that proposed dispatching rules provide better performance under problem assumptions. mean flow times for all the machine utilization levels examined .
Scheduling to Maximize Worker Satisfaction and On-Time Orders
Two important managerial objectives incorporated in production planning are the maximisation of the on-time delivery of orders and worker satisfaction. While the maximisation of on-time deliveries has frequently been considered in past production planning research, the component of maximising worker satisfaction has typically been ignored. The assignment of workers to their preferred jobs is an important factor since it results in a productive working environment with high worker performance and a low turnover rate. This study presents a job scheduling model that considers both criteria simultaneously and derives solution approaches to generate non-dominated solutions. The solution approaches are examined under various experimental conditions to evaluate their performance. Finally, a prototype tool developed as a proof of concept is presented.
Using dispatching rules for job shop scheduling with due date-based objectives
Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006., 2006
This paper addresses the job shop scheduling problem with the due date-based objectives including the tardy rate, the mean tardiness, and the maximum tardiness. The focused approach is the dispatching rules. Eighteen dispatching rules are selected from the literature, and their features and design concepts are discussed. Then a dispatching rule is proposed with the goal as achieving good and balanced performance when more than one objective is concerned at the same time. First, it realizes three good design principles recognized from the existing rules. Second, it introduces a due date extension procedure to solve a problem of negative allowance time. Third, a job candidate reduction mechanism is developed to make the rule computationally efficient. At last, a comprehensive simulation study is conducted with the eighteen existing rules as the benchmarks. The experimental results verify the superiority of the proposed rule, especially on the tardy rate and the mean tardiness.
Scheduling to maximise worker satisfaction and on-time orders
International Journal of Production Research, 2015
Two important managerial objectives in production planning are the maximization of the on time delivery of orders and the satisfaction of the workers. While the maximization of on time deliveries has been considered frequently in past production planning research, maximizing worker satisfaction has been typically ignored. The assignment of preferred tasks to workers is important since it results in a productive working environment with high worker performance and low turnovers. This paper presents a job scheduling model that considers both criteria simultaneously and derives solution approaches to generate non-dominated solutions. The solution approaches are examined under various experimental conditions to evaluate their performance. Finally a prototype tool developed as a proof of concept is presented.
Effect of load, processing time and due date variation on the effectiveness of scheduling rules
International Journal of Production Research, 2002
In real manufacturing environments, variations in production factors (i.e. processing time, demand, due-dates) are inevitable facts. All these dynamic changes, together with random disturbances (e.g. machine breakdowns) can seriously a ect the system performance. In this paper we focus on load, processing time and due date variation and analyse their impacts on a scheduling system. Speci®cally, we investigate the impact of variation on dispatching policies in a job shop environment via simulation. The statistical analysis of the results leads to two major conclusions: ®rst, the relative performance of rules is not threatened much by PV (processing time variation), LV (load variation) or DDV (due date variation) Ð a result that can be a consolation for practitioners in the ®eld. Secondly, the performance of the rules deteriorates, in particular at high levels of PV, LV and DDV Ð a result that can provide new insights into the problem and produces useful information for researchers in their continuous e ort to develop better dispatching rules.
The Effect of the Workload on Due Date Performance in Job Shop Scheduling
2008
This paper provides a simulation model to study the effect of the work-in-process control on due date performance in job shop environment. The due date performance is measured by both the number of tardy jobs and the total tardiness. The simulation runs include different shop configurations (flow shop and general job shop), workloads and sequencing rules. As expected, the results reveal that due date performance is highly dependent on the work-in-process, particularly after the system reaches saturation. Nevertheless, the model is very useful to show job shop managers the effect of the work-in-process control in the due date meeting performance.
The job shop tardiness problem: A decomposition approach
European Journal of Operational Research, 1993
An important criterion for evaluating the effectiveness of many manufacturing firms is their ability to meet due dates. In low to medium volume discrete manufacturing, typified by traditional job shops and more recently by flexible manufacturing systems, this criterion is usually operationalized on the shop floor through the use of prioritizing dispatching rules. The widespread use of dispatching rules has led to a number of investigations where the due date performance of various rules is compared. In contrast to previous research on dispatching rules, this paper proposes a new approach that _decomposes the dynamic problem into a series of static problems. These static problems are solved in their entirely, and then implemented dynamically on a rolling basis. To illustrate this approach, a specific heuristic is developed that constructs the schedule for the entire system by focusing on the bottleneck machine. Computational results indicate that significant due date performance improvement over traditional dispatching rules can be obtained by using this new approach.
The impact of variety of orders and different number of workers on production scheduling performance: a simulation approach
2012
Purpose-As the manufacturing activities in today's industries are getting more and more complex, it is required for the manufacturing firm to have a good shop floor production scheduling to plan and schedule their production orders. An accurate scheduling is essential to any manufacturing firm in order to be competitive in global market. The paper aims to discuss these issues. Design/methodology/approach-Two types of shop floors, job shop and cellular layout, were developed by using WITNESS simulation package. Consequently, the performance of forward scheduling and backward scheduling in both job shop and cellular layout was compared using simulation method, and the results were analyzed by using analysis of variance (ANOVA). Through analysis, the best scheduling approach and layout to be used by manufacturing firm in order to achieve the make-to-order (MTO) production and inventory strategy were reported. Findings-The results from simulation show that backward scheduling in job shop layout has the lowest average throughput time, lowest lateness, and highest labour productivity than forward scheduling. While in cellular layout, forward scheduling has the lowest average throughput time, lowest lateness, and highest labour productivity than backward scheduling in all conditions. It shows that the performance of scheduling approach is different in each production layout. Originality/value-Suitable scheduling approach is needed in manufacturing industry as to maximize production rate and optimize machine and process capability. This paper presents an empirical study about the assembly process of radio cassette player of one manufacturing industry in order to investigate the impact of variety of orders and different number of two workers on the performance of production scheduling approach. Forward scheduling and backward scheduling are used to schedule the production orders.
An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
International Journal of Production Research, 1999
An analysis of heuristics in a dynamic job shop with weighted tardiness objectives E. KUTANOGLU ² and I. SABUNCUOGLU * Meeting due dates as a re¯ection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quanti® cation of this qualitative goal involves tardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive literature survey on the topic, we measure the long-run performances of more than 20 single-pass dispatching rules under various experimental conditions. In this study, we pay special attention to recently proposed dispatching heuristics such as CEXSPT, CR+ SPT, S/RPT+ SPT, and Bottleneck Dynamics (BD). We also investigate the e ects of six resource pricing schemes proposed recently for BD. Moreover, we extend the earlier versions of inserted idleness and identif y the conditions in which these techniques can be applied without incurring too much computational cost. Future research directions are also outlined in light of the computational results.
Dispatching rules for production scheduling in the capital goods industry
International Journal of Production Economics, 2006
Research on dispatching rules has focused upon deterministic job shop situations or small assembly environments and ignored operational factors. This work uses data obtained from a capital goods company that produces complex products. The paper first explores the influence of the data update period and the minimum setup, machining and transfer times under stochastic infinite capacity conditions. It then investigates the significance of these factors and the relative performance of eight dispatching rules with finite capacity and stochastic processing times. Dispatching rules and most operational parameters were statistically significant. With finite capacity, the 'best' dispatching rule was different at the component and product levels and varied according to the performance measure used. The shortest operation time first rule generally produced the best results, particularly at product level. r
Correlation Among Tardiness Based Measures for Scheduling using Priority Dispatching Rules
One of the most used methods to schedule manufacturing systems is to use priority dispatching rules (pdrs). It is frequently desired to distinguish the behavior of pdrs in regards with tardiness based performance measures. But, the relation among these performance measures is generally not obvious even for the simple scheduling strategies such as pdrs. In this paper, we first focus on the maximum tardiness that is a very interesting performance measure for the decision-maker in the shop.
Workload Control and Order Dispatching Rules
Periodica Polytechnica Social and Management Sciences, 2022
The purpose of this study is to choose an order dispatching rule and measure the work-in-process and lead-time in the production process of a conveyor chain manufacturer. The main strategic issue for the manufacturer is dependability, which requires meeting deadlines and managing internal lead-times. The study integrates two techniques, workload control (WLC) and an analytical hierarchy process (AHP), respectively systems for production planning and control, and multi-criteria decision support, both widely used in handling manufacturing strategic issues. The research method is a field experiment. Supported by the AHP and according to strategic criteria, practitioners selected the early due date rule (the order with the closest due date comes first) to release 231 orders. Then, employing a methodology designed to support WLC applications, the study measured key parameters that provide information regarding the overall performance of the manufacturer, the input rate, work-in-process, ...
Customer order scheduling to minimize the number of late jobs
European Journal of Operational Research, 2007
In the order scheduling problem, every job (order) consists of several tasks (product items), each of which will be processed on a dedicated machine. The completion time of a job is defined as the time at which all its tasks are finished. Minimizing the number of late jobs was known to be strongly NP-hard. In this note, we show that no FPTAS exists for the two-machine, common due date case, unless P = NP. We design a heuristic algorithm and analyze its performance ratio for the unweighted case. An LP-based approximation algorithm is presented for the general multicover problem. The algorithm can be applied to the weighted version of the order scheduling problem with a common due date.
Optimal work order release for make-to-order job shops with customer order lead-time costs, tardiness costs and work-in-process costs
International Journal of Production Economics, 2008
Work order release mainly has been studied with regard to its impact on throughput, throughput time and work-in-process. In this research, we investigate work order release from an economic perspective. We study the situations where there are costs associated with the length of the customer order lead-time, the order tardiness and the work-in-process on the shop floor. Our research aims at minimizing the sum of these three costs. We derive expressions for the optimal value for the maximum number of orders that is allowed to be in process. Numerical analysis of a job shop model is used to investigate the reduction in total costs that results from optimally controlling the workin-process as compared to the total costs under immediate release of arriving orders. The results show that cost reductions can be substantial for small shops, and for high ratios of work-in-process costs to lead-time costs.
Minimization of Mean Tardiness in a Flexible Job Shop
International Journal of Simulation Modelling, 2013
In this paper, Selective Rerouting (SR) approach based on lateral entry of critical jobs in the queue of alternate machine is used to minimize the mean tardiness of the jobs in flexible job shop. Further, the efficacy of selective rerouting algorithm has been investigated by comparing it to the rerouting policies. Simulation studies using ProModel simulation software were carried out at different breakdown levels, mean time to repair levels, utilization levels of flexible job shop, due date tightness levels involving a total of 600 simulation runs. Each run of simulation spans for a period of 2000 completed jobs. The results establish that the proposed selective rerouting approach is better than other reported rerouting approaches as it improves 69.92 %, 69.31 %, 65.33 %, and 44.27 % mean tardiness compared with no rerouting, queue rerouting, arrival rerouting and all rerouting approaches respectively. It is seen that irrespective of the breakdown level in the investigated range, reduction of mean tardiness decreases in no rerouting, all rerouting, queue rerouting and arrival rerouting in the above order.
Evaluating the Impact of Order Picking Strategies on the Order Fulfilment Time: A Simulation Study
Acta logistica, 2019
A Distribution Centre (DC) is considered a critical node in providing optimal customer service levels in a supply chain network. Therefore, improving order fulfilment time at DCs becomes critical to achieve world-class operations. One of the key processes involved in order fulfilment is that of picking, the activity that consumes most time when fulfilling an order. This article presents the analysis of an actual system that stores products in a random fashion and releases orders following FIFO rules. A simulation model is built, and two scenarios analysed. The first one (baseline) reflects the current DC operation. The second scenario (projected) includes the implementation of three picking strategies aimed at improving system performance: slotting, wave picking, and expedite picking (balancing picker's workload). The following KPIs are used to compare both scenarios: order fulfilment lead-time, picks per man-hour, average picking time per order, average time to pack an order. Simulation results show that the systematic implementation of the proposed strategies achieves substantial improvements, not only in the order fulfilment time (54% reduction), but also in the number of orders completed in less than 8 hours, the number of orders picked per man hour and a reduction of pickers idle time.
Analyzing job shop scheduling problem by using dispatching rules
2018
Job shop scheduling is one of the most typical and complicated manufacturing environments in production scheduling problems. As a result of this complexity, Akaki spare parts share company (ASPSC) has faced problem of scheduling jobs in the machining shop, therefore as to reduce the make span of the jobs in the machining shop, the aim of the research paper is to assess scheduling job shop sequencing of jobs in the machining shop by using dispatching rule, so as to minimize the total make span of the jobs. Secondary data of five jobs that processed on six machines in the machining shop was collected from the production planning and control system unit catalog. By using lekin scheduling software we can obtain the result using alternative dispatching rules based on processing time of each jobs. From these result the longest processing time can give the best possible make span which is 1426 minute relative to shortest processing time and first come first serve rule. © 2018 ijrei.com. Al...
Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness
Proceedings of the 2010 Winter Simulation Conference, 2010
Related topics
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.