Handling the complexities of real-life job shops when implementing workload control: a decision framework and case study

The workload control literature highlights the importance of balancing the shop floor workload, but also acknowledges that this can conflict with processing the most urgent orders – hence, there is a trade-off. In practice, shops contain many complexities, e.g. simultaneous batching and sequence-dependent set-up times that may conflict with processing the most urgent orders and require other solutions than workload balancing to avoid capacity losses. This adds to the trade-off dilemma, which traditionally only considers timing and balancing. This paper develops a framework that determines whether to address a complexity through order release or dispatching. It comprises two dimensions: (i) the typical position of a complexity in the routing of an order and (ii) the criticality of the complexity. A case study is presented, which demonstrates the framework’s utility and illustrates the development of specific solutions designed to handle the complexities. Most complexities present in the case require handling at the order release stage. The challenges of handling multiple complexities at this decision level are evaluated. Finally, the implications for managers and future research are outlined.     

Improving the applicability of workload control (WLC): the influence of sequence-dependent set-up times on workload controlled job shops

Simulation has demonstrated that the workload control (WLC) concept can improve performance in job shops, but positive empirical results are scarce. A key reason for this is that the concept has not been developed to handle a number of practical considerations, including sequence-dependent set-up times. This paper investigates the influence of sequence-dependent set-up times on the performance of a workload-controlled job shop. It introduces new set-up-oriented dispatching rules and assesses the performance impact of controlled order release. Simulation results demonstrate that combining an effective WLC order release rule with an appropriate dispatching rule improves performance over use of a dispatching rule in isolation when set-up times are sequence dependent. The findings improve our understanding of how this key implementation challenge can be overcome. Future research should investigate whether the results hold if set-up time parameters are dynamic and set-up times are not evenly distributed across resources.     

Integrating load-based order release and priority dispatching

Workload control (WLC) is a well-established production control concept for job shops that put primary emphasis on load-based order release. Recent advances in load-based order release research have led to an improved delivery performance at reduced shop floor workloads. But although order release is the primary focus of WLC research, it must be coupled with priority dispatching on the shop floor if order progress is to be regulated. Prior simulation research suggests that load-based order release methods should only be coupled with simple dispatching rules because other, more powerful rules can conflict with the functioning of the release method. Yet, recent empirical research suggests that powerful priority dispatching rules – such as due date-oriented dispatching rules – are in fact needed for a high level of delivery performance to be obtained in practice. This paper focuses on overcoming the conflict between order release and dispatching, so load-based order release can be combined with due date-oriented dispatching. Preliminary analysis reveals that part of the conflict is because existing due date-oriented dispatching rules overcompensate for schedule deviations that occur when orders are either released earlier or later than planned. Two alternative new dispatching rules based on an improved method of determining operation due dates are then developed to better account for schedule deviations and overcome the conflict with load-based order release. Further improvements in delivery performance are obtained, while the large workload reductions achieved by recently developed load-based order release methods are retained.     

Successful implementation of an order release mechanism based on workload control: a case study of a make-to-stock manufacturer

This paper deals with improving the lead-time performance of a large crystal manufacturer that uses a state-of-the-art commercial Enterprise Resource Planning system. Since the company encountered some limitations of the standard production planning and control (PPC) system it sought for improvements by implementing an order release mechanism based on workload control (WLC). WLC employs certain rules for releasing orders in order to maintain a certain level of work in process to achieve a certain utilisation of the production system and thus control the flow times in order to meet the required due dates of the orders. We describe the successful implementation of an order release mechanism based on the WLC concept in this make-to-stock company. The paper describes the implemented order release mechanism, the implementation process and its impact on the company’s performance. We show that the core function of WLC – the order release mechanism – can be integrated successfully into an existing PPC system. Furthermore, this study highlights the applicability of WLC to a wider range of companies, especially to make-to-stock manufacturers.     

Integrated scheduling and self-reconfiguration for assembly job shop in knowledgeable manufacturing

The problems of integrated assembly job shop (AJS) scheduling and self-reconfiguration in knowledgeable manufacturing are studied with the objective of minimising the weighted sum of completion cost of products, the earliness penalty of operations and the training cost of workers. In AJS, each workstation consists of a certain number of teams of workers. A product is assumed to have a tree structure consisting of components and subassemblies. The assembly of components, subassemblies and final products are optimised with the capacity of workstations simultaneously. A heuristic algorithm is developed to solve the problem. Dominance relations of operations are derived and applied in the development of the heuristic. A backward insertion search strategy is designed to locally optimise the operation sequence. Once the optimal schedule is acquired, the teams are reconfigured by transferring them from workstations of lower utilisation to those of higher utilisation. Effectiveness of the proposed algorithm is tested by a number of numerical experiments. The results show that the proposed algorithm promises lower total cost and desirable simultaneous self-reconfiguration in accordance with scheduling.     

Three decades of workload control research: a systematic review of the literature

The workload control (WLC) concept has received much attention in the past three decades; however, a comprehensive literature review has not been presented. In response, this article provides a systematic review of the conceptual, analytical, empirical and simulation-based WLC literature. It explores the evolution of WLC research, determines the current state-of-the-art and identifies key areas for further study. The research finds that the field has evolved substantially. Early research focused on theoretical development and experimental testing of order release strategies; order release was then integrated with other planning stages, e.g., the customer enquiry stage, making the concept more suitable for customised manufacturing and leading to a comprehensive concept which combines input and output control effectively; recent attention has focused on implementing the resulting concept in practice and refining theory. While WLC is well placed to meet the needs of producers of customised products, future research should include: conducting further action research into how WLC can be effectively implemented in practice; studying human factors that affect WLC; and feeding back empirical findings to simulation-based WLC research to improve the applicability of WLC theory to real-life job shops.     

Scheduling in production,supply chain and Industry 4.0 systems by optimal control: fundamentals,state-of-the-art and applications

This paper presents a survey on the applications of optimal control to scheduling in production, supply chain and Industry 4.0 systems with a focus on the deterministic maximum principle. The first objective is to derive major contributions, application areas, limitations, as well as research and application recommendations for the future research. The second objective is to explain control engineering models in terms of industrial engineering and production management. To achieve these objectives, optimal control models, qualitative methods of performance analysis and computational methods for optimal control are considered. We provide a brief historic overview and clarify major mathematical fundamentals whereby the control engineering terms are brought into correspondence with industrial engineering and management. The survey allows the grouping of models with only terminal constraints with application to master production scheduling, models with hybrid terminal–logical constraints with applications to short term job and flow shop scheduling, and hybrid structural–terminal–logical constraints with applications to customised assembly systems such as Industry 4.0. Computational algorithms in state, control and adjoint variable spaces are discussed.     

卡片导航平衡控制系统性能仿真研究

为了减少装配作业车间内因物料齐套产生的等待浪费,使具有装配约束的关联零件加工进度得到有效协同,设计一类卡片导航平衡控制系统 (control of balance by card-based navigation,COBACABANA)。其基于两类卡片循环回路实现任务投放与作业分派的可视化进度协同控制逻辑。本文详细介绍系统的运行机制和系统控制参量,通过构建一般化的装配作业车间仿真模型,探讨在不同装配关联度下各控制参量的性能变化。实验结果表明,COBACABANA系统性能良好,并且选择合适的控制参量就能够有效提升关联零件的进度协同性。     

An evaluation of worker cross training and flexible workdays in job shops

Capacity flexibility is becoming increasingly important as a means for reducing inventory while maintaining customer service levels. We examine two means to increase capacity flexibility. In particular, we examine an environment where both cross training and flexible workdays are available to respond to workload variability. Flexible workdays are under consideration in the US Legislature. This proposed legislation provides the opportunity for workers to exchange overtime for time off. From a managerial perspective, flexible workdays allow management to shift capacity from periods of light load to periods of heavy load. We simulate the operation of a job shop with both cross training and flexible workdays. Our results indicate that cross training is a far more effective tool for improving performance as compared to flexible workdays. Flexible workdays can be valuable particularly in volatile conditions. However, our results indicate that the degree of cross training is a critical consideration in determining the impact of flexible workdays.     

An extension of modified-operational-due-date priority rule incorporating job waiting times and application to assembly job shop

The well-known priority dispatching rule MOD (Modified Operational Due Date) in job shop scheduling considers job urgency through ODD (Operational Due Date) and also incorporates SPT (Shortest Processing Time)-effect in prioritising operationally late jobs; leading to robust behaviour in Mean Tardiness (MT) with respect to tightness/looseness of due dates. In the present paper, we study an extension of the MOD rule using job-waiting-time based discrimination among operationally late jobs to protect long jobs from excessive delays by incorporating an ‘acceleration property’ into the scheduling rule. Formally, we employ a weighted-SPT dispatching priority index of the form: (Processing time)/(Waiting time)^α for operationally late jobs, while the priority index is ODD for operationally non-late jobs; and the latter class of jobs has a lower priority than the former class. In the context of Assembly Job Shop scheduling, some existing literature includes considerable focus around the concept of ‘Staging Delay’, i.e., waiting of components or sub-assemblies for their counterparts for assembly. Some existing approaches attempt dynamic anticipation of staging delay problems and re-prioritisation of operations along converging branches. In the present paper, rather than depending on such a centralised and largely backward scheduling approach, we consider a partially decentralised approach, endowing jobs with a priority index yielding an ‘acceleration property’ based on a ‘look-back’ in terms of waiting time, rather than ‘look-ahead’. For the particular case, in our proposed rule, whenα is set at zero and when all jobs at a machine are operationally late, our rule agrees with MOD as both exhibit the SPT effect. In simulation tests of our priority scheme for assembly job shops, in comparison with leading heuristics in literature, we found our rule to be particularly effective in: (1) minimising conditional mean tardiness, (2) minimising 99-percentile-point of the tardiness distribution, through proper choice ofα. We also exploit an interesting duality between the scheduling and queueing control versions of the problem. Based on this, some exact and heuristic analysis is given to guide the choice ofα, which is also supported by numerical evidence.     

Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems

The goal of the current study is to identify appropriate application domains of Ant Colony Optimisation (ACO) in the area of dynamic job shop scheduling problem. The algorithm is tested in a shop floor scenario with three levels of machine utilisations, three different processing time distributions, and three different performance measures for intermediate scheduling problems. The steady-state performances of ACO in terms of mean flow time, mean tardiness, total throughput on different experimental environments are compared with those from dispatching rules including first-in-first-out, shortest processing time, and minimum slack time. Two series of experiments are carried out to identify the best ACO strategy and the best performing dispatching rule. Those two approaches are thereafter compared with different variations of processing times. The experimental results show that ACO outperforms other approaches when the machine utilisation or the variation of processing times is not high.     

The consequences of an increase in heavy goods vehicles for passenger car drivers' mental workload and behaviour: a simulator study

The effects of an increase in Heavy Goods Vehicles (HGVs) on merging behaviour and on mental workload of motorists during filtering in and out of traffic were studied. Participants drove in a driving simulator in a total of 12 conditions; twice in each of two weather conditions and in three traffic conditions. The weather conditions were clear weather and foggy weather. The traffic conditions were without HGVs (i.e. only private cars), the current mix of HGVs and private cars, and a condition with a 70% increase of HGVs leading to an HGV column in the slow lane. The focus of the study was on assessing effects on behaviour and mental workload during filtering into traffic, and during exiting from the motorway. During the experiment driving performance was registered, behaviour was observed, self reports were collected, and the participant's heart rate was recorded. The results showed that directly after filtering into traffic the variation in driving speed increased and the minimum time headway decreased with an increase in the proportion of HGVs. Joining motorway traffic was considered to involve greater effort and risk in the condition with a column of HGVs. The effects of the conditions on heart rate are less clear, although the moment when the participants joined the traffic is clearly visible. The effects of weather conditions were limited, drivers adapting their driving behaviour in adverse weather by reducing speed. To exit the motorway is not a difficult manoeuvre. For that reason the lane change from the left hand to the right hand lane that preceded the exit was analysed. Although increased mental effort was reported and the lane change was visible in the heart rate record, no critical changes as a result of increase in proportion of HGVs were found for this manoeuvre. However, in the condition with a column of HGVs, the exit that had to be taken was most frequently missed as HGVs obstructed the view of the exit signs. It is concluded that an increase in HGVs will make merging into traffic more mentally demanding and will decrease safety margins.     

Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism

This paper applied a novel evolutionary algorithm, imperialist competitive algorithm (ICA), for a group scheduling problem in a hybrid flexible flow shop with sequence-dependent setup times by minimising maximum completion time. This algorithm simulates a social-economical procedure, imperialistic competition. Initial population is generated randomly and evolution is carried out during the algorithm. Firstly individuals, countries, are divided into two categories: imperialists and colonies. Imperialist competition will occur among these empires. This competition will increase some empires authority by ruining a weak empire and dividing its colonies among others. Electromagnetic-like mechanism concepts are employed here to model the influence of the imperialist on their colonies. The algorithm will continue until one imperialist exists and possesses all countries. In order to prevent carrying out extensive experiments to find optimum parameters of the algorithm, we apply the Taguchi approach. The computational results are compared with the outstanding benchmark on the flow shop scheduling problem, random key genetic algorithms (RKGA), and it shows superiority of the ICA.     

Analysis and improvement of multi-product assembly systems: an application study at a furniture manufacturing plant

In this paper, we introduce an application study of modelling, analysis and continuous improvement of an assembly system at a furniture manufacturing plant using production systems engineering methods. Analytical models have been developed to characterise the assembly system making multiple products, and recursive procedures have been derived to evaluate line production rate. Lot size analysis is carried out, and bottleneck analysis methods are introduced to identify the bottlenecks, whose improvement can lead to the largest improvement in system performance. Such methods provide a quantitative tool for plant engineers and managers to operate and improve assembly line with high productivity, and are also applicable to other large-volume manufacturing systems.     

The study of real time scheduling by an intelligent multi-controller approach

Earlier studies indicated that using multiple dispatching rules (MDRs) for the various zones in the system can enhance the production performance to a greater extent than using a single dispatching rule (SDR) over a given scheduling interval for all the machines in the system, since MDRs employ the multi-pass simulation approach for real-time scheduling (RTS). However, if a classical machine learning approach is used, an RTS knowledge base (KB) can be developed by using the appropriate MDRs strategy (this method is called an intelligent multi-controller in this paper) as obtained from training examples. The main disadvantage of using MDRs is that the classes (scheduling decision variables) to which training examples are assigned must be provided. Hence, developing an RTS KB using the intelligent multi-controller approach becomes an intolerably time-consuming task because MDRs for the next scheduling period must be determined. To address this issue, we proposed an intelligent multi-controller incorporating three main mechanisms: (1) simulation-based training example generation mechanism, (2) data pre-processing mechanism and (3) SOM-based real time MDRs selection mechanism. Under various performance criteria over a long period, the proposed approach yields better system performance than the machine learning-based RTS using the SDR approach and heuristic individual dispatching rules.     

Optimal tracking control of flow velocity in a one-dimensional magnetohydrodynamic flow

This article considers a dynamic optimization problem arising in a one-dimensional magnetohydrodynamic flow, which can be modelled by coupled partial differential equations, where the external control input (external induction of magnetic field) takes a multiplicative effect on the system states (momentum and magnetic components). The aim is to drive the flow velocity to within close proximity of a desired target of flow velocity at the pre-indicated terminal time. First, the Galerkin method is utilized to reduce the original dynamic optimization problem to a lower finite-dimensional dynamic optimization problem governed by a set of ordinary differential equations. Then the control parameterization method is employed to parameterize the finite-dimensional optimization problem and thus obtain an approximate optimal parameter selection problem, which can be solved using gradient-based optimization techniques, such as sequential quadratic programming. The exact gradients of the cost functional with respect to the decision parameters, which are the key advantages of this approach, are computed using the analytical equations. Finally, numerical examples are illustrated to verify the effectiveness of the proposed method. The novel scheme of this article is to develop an effective computational optimal control method for realizing the optimal tracking control of flow velocity in a one-dimensional magnetohydrodynamic flow.     

Six Sigma企业与品质管理系统在制膜工业上的应用

六西格玛作为一种有效的企业和品质管理系统,已被许多美国大公司采用．将六西格玛用于制膜工业,可以使膜产品具有更强的市场竞争力．文章通过一些实例,介绍了六西格玛在科研和制膜方面的应用．