Priority dispatching rules in an assembly shop

This paper reports the results of a job shop computer simulation study in which jobs were made up of several parts, and where operations on the different parts can be going on at the same time in different machining centres. Priority rules are evaluated in terms of average job flow time, and have been chosen mainly for their ability to coordinate the completion time of the various job parts. A rule based on the minimum remaining job time has been found to produce the best results. The paper also attempts to classify the various priority rules in terms of their operational significance.     

Dynamic selection of dispatching rules for job shop scheduling

Although the academic contribution to job shop scheduling is abundant, its impact on practice has been minimal. The most preferred approach to job shop scheduling in the industry is dispatching rules. A major criticism against dispatching rules is that there is no single universal rule. The effective choice of dispatching rules depends on the scheduling criterion and existing job shop conditions. In this paper, the authors have proposed a scheduling method based on the analytic hierarchy process, that dynamically selects the most appropriate dispatching rule from several candidate rules. The selection is based on the existing job shop conditions. This method is applied to two formal job shop problems, and the results for single dispatching rules are inferior to the method proposed in this paper.     

A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors

The literature on job scheduling recognizes the importance of due date performance criteria such as mean tardiness and maximum tardiness. A number of studies test a large number of sequencing rules for these criteria in job shop and flow shop settings. The object of this present research is to examine the performance of some well-known priority rules in a flow shop with multiple processors. This study investigates the performance of ten priority rules in terms of mean and maximum tardiness. It examines the effects of problem characteristics, such as number of jobs, number of machines stages and number of parallel processors at each stage, and the performance of priority rules using regression analysis. The findings of the study suggest that the primary determinants of tardiness-based criteria are problem characteristics. In addition, both the regression analysis and the analysis of variance provide strong evidence of the strategy-effect. Finally, a detailed performance review of examined priority rules for various problem characteristics is presented.     

A comparative study of some priority dispatching rules under different shop loads

Priority dispatching rules and shop load affect job-shop performance. This paper evaluates ten different priority dispatching rules with respect to six different performance criteria under light, medium and heavy shop loads. Simulation was used as a tool to determine the rankings of the dispatching rules for a given shop load and performance criteria. A comparative study was conducted to investigate the performance of these rules. Two rules, ‘shortest processing time” and ‘least work remaining’, performed well under criteria related to the processing time. It was found that the rules that perform well in average and r.m.s. tardiness perform poorly under percentage-of-jobs-late criterion. The experimental results are conveyed with critical comments on the performance of the dispatching rules under different loading conditions of the shop.     

Learning from suppliers: a framework for operation innovation in small and medium sized enterprises

Abstract

Inter-firm learning though partnering with suppliers is often considered as a relatively cheap way to develop the knowledge necessary for innovating operations procedures. SMEs may benefit, especially from the inflow of information, as they face multiple restrictions on innovating manufacturing or delivery processes due to their small size and limited resources. Based on the two studies – a logistic regression analysis and a configuration analysis – evidence was found that small- and medium-sized enterprises (SME) need to integrate knowledge sources in distinct knowledge configurations. In particular, it is shown that an operation process innovation (OPI) strategy for SME is incomplete if it does not find a way to combine internal and external knowledge to innovate operation procedures. The main contribution of this paper is to uncover the precise composition of effective knowledge configurations, which leads to innovation.     

Internationalization of small and medium sized enterprises in the Baltic Sea Region

We integrate internationalization process theory with industrial network theory to explain SME entry in emerging markets. We show that entry modes are complemented by entry nodes and entry processes. We develop a Five/Five Stages Model to consider the dynamic interaction between these factors. We undertook a survey of 116 SMEs in Southern Sweden trading with the Baltic States, Poland and Russia, as complemented by a case study of ten SMEs trading with Poland and an analysis of trade statistics of SMEs in Southern Sweden.We find that relationships are critical for entry as most firms rely on direct relationships with customers or dyads. The involvement of subsidiaries is uncommon, suggesting a low degree of FDI. Meanwhile, triads or indirect relationships through distributors or agents are more important. This low cost entry node creates a paradox in that the insufficient learning it provides about local markets obstructs further internationalization. By relating entries to the global internationalization process, we find that most SMEs trade with few countries in the region, indicating a low degree of regional internationalization.     

A collaboration concept for TQM implementation in small and medium sized enterprises

The article presents a concept to implement total quality management (TQM) in small and medium sized enterprises (SME) and is based on a yearlong collaboration between a college and local SME's. An annual course is developed and offered to both company participants and students who work together in project teams and in genuine projects at the companies. The course curriculum is presented and analyzed and the ability of the course to facilitate the companies' long-term quality strategies is discussed. The outcomes of the course, as reported by the companies, show that the collaboration has supported their long-term implementation of TQM.     

制约因素在项目进度管理的应用

本文反映了项目进度管理的重要意义,采用了制约因素论的五步骤法详细地论述了项目进度延迟的原因,并提出了相应的对策,其中突出地强调了它的实用性.它主要围绕"项目必须遵守整体优化而非局部优化"这一思想,抓住项目进度的制约因素进行阐述.     

Overtime usage in a job shop environment

Problems are encountered in a job shop which has a fixed capacity if the total work content of the jobs passing through the shop increases sufficiently. Even the use of effective priority dispatching rules and/or expediting does not adequately shorten the queues which develop if the total work content continually exceeds shop capacity. To avoid losing job orders because the orders are unduly delayed, the job shop might resort to overtime usage. This study examines the efficient and economic use of overtime to relieve the backlog problem and uses overtime as the basic criterion for evaluation of overtime usage. The study employs GPSS V programming language to simulate a hypothetical job shop. The shop is loaded to various proportions of its normal capacity and various levels of overtime are tested. Findings show that overtime should not be assigned indiscriminately but rather should be based on a shop's unique conditions of overtime cost, the priority rule being employed, and the level of capacity utilization. Marginal benefit-cost ratio curves are developed to determine whether overtime usage is economically reasonable. These curves may also be used to determine the maximum or limiting amount of overtime to use under specific shop conditions.     

Operation-based flowtime estimation in a dynamic job shop

In the scheduling literature, estimation of job flowtimes has been an important issue since the late 1960s. The previous studies focus on the problem in the context of due date assignment and develop methods using aggregate information in the estimation process. In this study, we propose a new flowtime estimation method that utilizes the detailed job, shop and route information for operations of jobs as well as the machine imbalance information. This type of information is now available in computer-integrated manufacturing systems. The performance of the proposed method is measured by computer simulation under various experimental conditions. It is compared with the existing flowtime estimation methods for a wide variety of performance measures. The results indicate that the proposed method outperforms all the other flowtime estimation methods. Moreover, it is quite robust to changing shop conditions (i.e., machine breakdowns, arrival rate and processing time variations, etc.). A comprehensive bibliography is also provided in the paper.     

Cost models for lot streaming in a multistage flow shop

Lot streaming is a technique used to split a processing batch into several transfer batches. In this way, overlapping operations can be performed in different manufacturing stages, and production can be accelerated. This paper proposes two cost models for solving lot streaming problems in a multistage flow shop. The purpose is to determine the optimal processing batch size and the optimal number of transfer batches that minimize the total annual cost in each model. In the first model, a more complete and accurate method is developed to compute the costs of raw materials, work-in-process, and finished-product inventories. The total cost includes the setup cost, the transfer batch movement cost, the three-type inventory holding cost, and the finished-product shipment cost. The second model contains not only the four costs in the first model, but also the imputed cost associated with the makespan time. The total annual cost functions in both models are shown to be convex, and two solution approaches are suggested. An experiment consisting of three phases was conducted to explore the effect on the optimal solution when changing the value of one parameter at a time. The results indicate that three parameters have significant effects on the optimal solution.     

MRP in a job shop environment using a resource constrained project scheduling model

One of the most difficult tasks in a job shop manufacturing environment is to balance schedule and capacity in an ongoing basis. MRP systems are commonly used for scheduling, although their inability to deal with capacity constraints adequately is a severe drawback. In this study, we show that material requirements planning can be done more effectively in a job shop environment using a resource constrained project scheduling model. The proposed model augments MRP models by incorporating capacity constraints and using variable lead time lengths. The efficacy of this approach is tested on MRP systems by comparing the inventory carrying costs and resource allocation of the solutions obtained by the proposed model to those obtained by using a traditional MRP model. In general, it is concluded that the proposed model provides improved schedules with considerable reductions in inventory carrying costs.     

Synchronization of material flow to aid production planning in a job shop

This paper discusses how synchronizing finish times for correspondingly numbered process operations of mating component parts (batches) can help a job shop take advantage of some aspects of the just-in-time philosophy.This paper proposes that the synchronization of process operations of mating parts (batches) can be an effective production planning tool that may actually decrease total throughput time where manufacturers are attempting to decrease in-process inventory. An example problem is included to demonstrate the situation.A production planner must keep in perspective all production orders when trying to decrease in-process inventory. The throughput times of all orders may be increased, while too much effort is concentrated on reducing in-process inventory costs of individual orders.     

An evaluation of the DBR control mechanism in a job shop environment

This study is an evaluation of the drum–buffer–rope (DBR) control mechanism compared to the modified infinite loading (MIL) control mechanism in a job shop environment. Although previous research has shown that the MIL mechanism works well in this environment, this study finds that the DBR control mechanism performs significantly better. The performance of the DBR mechanism improves when the shortest processing time (SPT) dispatching rule is used.     

Optimizing real-time vehicle sequencing of a paint shop conveyor system

A discrete event simulation model and a decision optimizer that were developed for a General Motors paint shop conveyor system are presented. The simulation model interacts with the decision optimizer at four critical points in the system, trying to regroup batches of different colored vehicles. The decision optimizer employs dynamic programming and integer programming to optimize vehicle routing policies. Simulation results of the current decision making policies are compared with those of the proposed optimized policies showing that the number of paint head changes can be significantly reduced resulting in substantial savings on paint head cleaners and paint.     

Evaluation of scheduling strategies for a dynamic job shop in a tool-shared,flexible manufacturing environment

A two-phase approach is used to examine the impact of job scheduling rules and tool selection policies for a dynamic job shop system in a tool-shared, flexible manufacturing environment. The first phase develops a generalized simulation model and analyses 'simple' job scheduling rules and tool selection policies under various operating scenarios. The results from this investigation are then used to develop and analyse various bi-criteria rules in the second phase of this study. The results show that the scheduling rules have the most significant impact on system performance, particularly at high shop load levels. Tool selection policies affect some of the performance measures, most notably, proportion of tardy jobs, to a lesser degree. Higher machine utilizations can be obtained at higher tool duplication levels but at the expense of increased tooling costs and lower tool utilization. The results also show that using different processing time distributions may have a significant impact on shop performance.     

Development of simulation-based production execution system in a shipyard: a case study for a panel block assembly shop

The management of a panel block shop in a shipyard is a complex process that entails the largest amount of work and in which many decisions are involved. Shipbuilders have considered the process as a bottleneck since every panel for every ship must be processed through the shop. The objective of this research is to carry out a materials flow analysis to maximise process productivity and to place simulation optimisation technology in the hands of decision makers, such as production planners and supervisors. In this article, a production execution planning system is proposed for panel block operations utilising discrete-event simulation and simulated annealing. The simulation model was validated using a real production scenario and the comparison showed a very favourable agreement between the actual panel shop and the simulation model. The proposed system supports production planners by general dispatching rules and optimisation to make better scheduling decisions on the shop floor. The system will provide a complete schedule that is at least as clear and accurate as any schedule currently obtained.     

Evaluation of simple dispatching rules for dynamic single-machine earliness/tardiness problem

Abstract. This paper investigates the effects of four simple dispatching rules on just-in-time production related performance measures of mean and maximum absolute lateness. The rules used are modified due date (MDD), shortest processing time (SPT), earliest due date (EDD), and first in first out (FIFO). A single machine is used under three utilization levels. Due-dates are set according to total work content rule. The results indicate that each rule performs well under certain conditions. The MDD rule is the best one to minimize mean absolute lateness. The EDD and FIFO rules do well in minimizing the maximum absolute lateness. Economic interpretation of these performance measures are also discussed.