Flexible reasoning using sensible agent-based systems: A case study in job flow scheduling

Planning and control systems for highly dynamic and uncertain manufacturing environments require adaptive flexibility and decision-making capabilities. Modern distributed manufacturing systems assess the utility of planning and executing solutions for both system goals (e.g. minimize manufacturing production time for all parts or minimize WIP) and local goals (e.g. expedite part A production schedule or maximize machine X utilization). Sensible Agents have the ability to alter their autonomy levels to choose among a set of decision models in order to handle the differences between local and system goals. In this paper, Sensible Agents are applied to a production planning and control problem in the context of job shop scheduling and decision model theory. Sensible Agents provide for trade-off reasoning mechanisms among system and local utilities that are flexible and responsive to an agent's abilities, situational context and position in the organizational structure of the system.     

The sensitivity of job mix and load capacity bottlenecks on inventory and due date performance in a manufacturing system

Based on a benchmark job-lot manufacturing system a simulation study was carried out to compare the performance of just-in-time (JIT) shop control system Kanban with conventional job-shop control procedures. The shop control policies were tested under a good manufacturing environment and the effects of job mix and load capacity bottlenecks on various shop control policies were tested. From the simulation results, it is inferred that there are shop control procedures that perform better than the Kanban in a job shop. It has been observed that even with adequate capacity, bottleneck areas surface due to fluctuations in the shop load. Kanban is not appropriate in such a situation because capacity bottlenecks can significantly reduce the ell'ectiveness of a pull system. The disparateness in the processing requirements for jobs can seriously undermine the performance of the shop. This is the type of shop environment where the shop control procedures will be most effective. Although Kanban came out best when the load capacity bottlenecks and the disparateness of the job mix were removed, the selected shop control variable combinations closely approximated the Kanban result. Although many features of JIT can be implemented in any system, companies trying to adopt JIT should remember that Kanban requires a rigid system intolerant of any deviation.     

STATE-OF-THE-ART SURVEY: OPEN QUEUEING NETWORKS: OPTIMIZATION AND PERFORMANCE EVALUATION MODELS FOR DISCRETE MANUFACTURING SYSTEMS

In this survey we review methods to analyze open queueing network models for discrete manufacturing systems. We focus on design and planning models for job shops. The survey is divided in two parts: in the first we review exact and approximate decomposition methods for performance evaluation models for single and multiple product class networks. The second part reviews optimization models of three categories of problems: the first minimizes capital investment subject to attaining a performance measure (WIP or lead time), the second seeks to optimize the performance measure subject to resource constraints, and the third explores recent research developments in complexity reduction through shop redesign and products partitioning.     

Workload Control and Order Release: A Lean Solution for Make‐to‐Order Companies

Protecting throughput from variance is the key to achieving lean. Workload control (WLC) accomplishes this in complex make‐to‐order job shops by controlling lead times, capacity, and work‐in‐process (WIP). However, the concept has been dismissed by many authors who believe its order release mechanism reduces the effectiveness of shop floor dispatching and increases work center idleness, thereby also increasing job tardiness results. We show that these problems have been overcome. A WLC order release method known as “LUMS OR” (Lancaster University Management School order release) combines continuous with periodic release, allowing the release of work to be triggered between periodic releases if a work center is starving. This paper refines the method based on the literature (creating “LUMS COR” [Lancaster University Management School corrected order release]) before comparing its performance against the best‐performing purely periodic and continuous release rules across a range of flow directions, from the pure job shop to the general flow shop. Results demonstrate that LUMS COR and the continuous WLC release methods consistently outperform purely periodic release and Constant WIP. LUMS COR is considered the best solution in practice due to its excellent performance and ease of implementation. Findings have significant implications for research and practice: throughput times and job tardiness results can be improved simultaneously and order release and dispatching rules can complement each other. Thus, WLC represents an effective means of implementing lean principles in a make‐to‐order context.     

An investigation of output flow control,bottleneck flow control and dynamic flow control mechanisms in various simple lines scenarios

Flow control mechanisms have been a topic of academic research for several years. With the growth of business-wide information systems such as enterprise resource planning and supply chain, better planning, scheduling and control of the business transformation process is required in order to achieve increased throughput, reduced inventories, shorter lead times and reduced tardiness. This research compares two new approaches to flow control, output flow control and bottleneck flow control to a real-time flow control system, dynamic flow control. Both output and bottleneck flow control mechanisms are much simpler to implement and manage than dynamic flow control in that they do not require continual feedback and rescheduling. Line characteristics, such as location of breakdowns with respect to the bottleneck, the location of the bottleneck when breakdowns occur, and the impact of variability of processing times on the performance measures (output, WIP level, lateness, and number of tardy jobs) for these three flow control mechanisms are compared. Both output and bottleneck flow control mechanisms perform favourably (particularly bottleneck) under different scenarios and warrant further study across a wider range of scenarios (mixed models, job shops, etc.).     

Judicious order acceptance and order release in make-to-order manufacturing systems

This paper explores a two-stage input control system for fixed capacity make-to-order manufacturing systems (with heavy job tardiness penalties), that selectively accepts incoming orders and holds the accepted ones in a pre-shop queue prior to releasing them to the shop floor. Single-stage input control systems that only allow orders to be delayed in a pre-shop queue (i.e. they do not allow some orders to be rejected) have been previously investigated and found to negatively impact overall due-date performance. The hypothesis motivating this research is that judiciously rejecting a subset of incoming orders can prevent the order release queue from being overloaded when a surge of demand occurs. The input control system is evaluated via experiments using a discrete-event simulation model of a fixed capacity manufacturing system. The experiments reported here suggest that holding orders in the pre-shop queue does not improve due date performance, and that judiciously rejecting orders on its own is a viable alternative mechanism of input control that can deliver improved performance.     

Order Dispatching and Labor Assignment in Cellular Manufacturing Systems

Although order and labor dispatching in the job shop manufacturing setting have been investigated extensively over the last three decades, its representation of actual processes found in practice today is limited due to the move to cellular manufacturing (CM). Manufacturing cells have become an important approach to batch manufacturing in the last two decades, and their layout structure provides a dominant flow structure for the part routings. The flow shop nature of manufacturing cells adds a simplifying structure to the problem of planning worker assignments and order releases, which makes it more amenable to the use of optimization techniques. In this paper we exploit this characteristic and present two mathematical modeling approaches for making order dispatching and labor assignment/reassignment decisions in two different CM settings. The two formulations are evaluated in a dynamic simulation setting and compared to a heuristic procedure using tardiness as the primary performance measure. The formulations are superior to the heuristic approach and can be incorporated into detail scheduling systems that are being implemented by corporations employing enterprise resource planning (ERP) systems today.     

A Load‐based and Due‐date‐oriented Approach to Order Review/Release in Job Shops*

In this paper, a new order review/release (ORR) method is proposed for shop floor control systems. The proposed method utilizes both job due date and shop load information to improve the effectiveness of the ORR function in production systems. The performance of the new method is compared to those of a few well‐known ORR methods under four experimental conditions. The results of extensive simulation experiments indicate that the proposed method is superior with respect to the mean absolute deviation measure. In general, it is also better than existing methods for the other performance measures. Furthermore, we show that the proposed method is more robust to variations in system load and processing times than the other ORR methods examined.     

An Entropy Measure of Flow Dominance for Predicting Operations Performance

The flow of jobs within a system is an important operating characteristic that influences system performance. While the majority of previous studies on manufacturing performance consider product flows only as an implicit parameter of the design, we introduce an explicit measure of flow dominance based on entropy and test its efficacy in predicting the performance of manufacturing systems. In computing entropy flow dominance (EFD), we aggregate information embedded in the routings of all products within a system into a single measure. EFD is designed to indicate on a 0–1 scale the level of flow dominance, where 1 represents a pure flow shop and 0 represents a pure job shop. The result is a simple measure that provides managers a way to explain and predict complex phenomena. Our experimental results indicate that EFD is a statistically significant determinant of manufacturing system performance. Furthermore, the model including EFD as an independent variable accurately predicts manufacturing system performance as measured by job flow time, flow time standard deviation, and work in process. We note that the same results can also apply to service systems, such as the “back‐room” low‐contact type systems, that have similar characteristics as manufacturing systems.     

Achieving manufacturing excellence through the integration of enterprise systems and simulation

This paper discusses the significance of the enterprise systems and simulation integration in improving shop floor’s short-term production planning capability. The ultimate objectives are to identify the integration protocols, optimisation parameters and critical design artefacts, thereby identifying key ‘ingredients’ that help in setting out a future research agenda in pursuit of optimum decision-making at the shop floor level. While the integration of enterprise systems and simulation gains a widespread agreement within the existing work, the optimality, scalability and flexibility of the schedules remained unanswered. Furthermore, there seems to be no commonality or pattern as to how many core modules are required to enable such a flexible and scalable integration. Nevertheless, the objective of such integration remains clear, i.e. to achieve an optimum total production time, lead time, cycle time, production release rates and cost. The issues presently faced by existing enterprise systems (ES), if properly addressed, can contribute to the achievement of manufacturing excellence and can help identify the building blocks for the software architectural platform enabling the integration.     

Search based job scheduling and sequencing with setup times

The problem of sequencing jobs on a machine in a job shop has been approached by a number of researchers and practitioners. One of the most popular methods is to apply a priority rule to the queue at each machine. The authors have previously published details of an approach which sets the priority of a job as a linear combination of the operation times and due date for that job. The coefficients in the linear combination are set by a simulation and search procedure so as to give good performance based on the performance measure specified. This paper extends this approach to include setup time factors. This extended approach is then applied to data from an actual manufacturing system. The extended approach is shown to improve the performance of the manufacturing system in relation to existing techniques.     

Manufacturing cycle time reduction using balance control in the semiconductor fabrication line

In semiconductor manufacturing, wafer fabrication is the most complicated and important process, and is composed of several hundred process steps and involves several hundred machines. The productivity of the manufacturing process depends mainly on controlling the balance of WIP (work-inprogress) flow to achieve maximum throughput under short manufacturing cycle times. This paper discusses how to determine the proper WIP level for operations, against which balance status can be measured. Balance measurement can be applied in mathematical modelling for bottleneck scheduling and operations management of the fabrication line. Performances are evaluated through computational experiments to show that balance driven management leads to 15-33% more production in 21% shorter manufacturing cycle time than production driven management.     

An enhanced loading model for the probabilistic workload control under workload imbalance

Load-oriented manufacturing control (LOMC), a well known probabilistic approach to workload control, is based on limiting and smoothing workload using one static parameter for each workcentre, called load limit (LL). The value of this parameter is set by the shop managers based on the planned lead time at each workcentre. In this paper the use of LL is shown to be inappropriate for the smoothing of workloads when the workload is not sufficiently balanced. We propose to enhance the LOMC model by introducing two sets of parameters:

(i) limiting parameters (LPs), that are statical parameters of the workcentres, set by the shop managers. LPs are used to limit the workload released to the shop;

(ii) smoothing parameters (SPs), that are dynamical parameters of the workcentres, computed as a function of their real workload. SPs are used to smooth the jobs workload over downstream workcentres.

A simulation model was used to compare the enhanced model, based on two parameters sets, with the traditional LOMC model, based on a single parameter set. The simulation runs were earned out with different conditions of due-date assignments, dispatching rules and production mix. The statistical analysis performed on experimental results confirmed that the enhanced model achieves significantly better due dates under unbalanced workload conditions.     

Shop floor characteristics influencing the use of advanced planning and scheduling systems

The purpose of this article is to investigate how the manufacturing process, the shop type and the data quality, i.e. the shop floor characteristics, influence the use of advanced planning and scheduling (APS) systems in production activity and control (PAC). The methodology implemented is a multiple case study at three case companies. Each company has different shop floor characteristics, but all use a scheduling module in an APS system, which supports production scheduling. A theoretical framework is developed suggesting how APS system are used in the PAC activities, and which major aspect to consider. The case analysis shows that the scheduling module in APS system, foremost supports sequencing and dispatching. In particular, the shop type is influenced by the decision of how often the APS runs and what freedom is given to the shop floor. The manufacturing process influences how the dispatch list is created. Contrary to the literature presuming that APS systems are most suitable in job shop processes, it is found that the manufacturing process is not a crucial factor when deciding whether APS systems are an appropriate investment. It is found that the level of data quality needed in the APS system depends to a large extent on how the dispatch list is used. For example, is the dispatch list used as a guideline, not a regulation, the need for accurate data in the module is reduced. This article extends the previous literature concerning APS systems by analysing how APS systems influence PAC as a whole and increase the understanding of the challenges of using APS systems in PAC.     

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.     

Tardiness heuristic for scheduling Flexible Manufacturing Systems

Abstract

This paper evaluates the tardiness performance of a sampling-based adaptive heuristic in a dynamic manufacturing environment. A test bed, following a real world manufacturing system, has been developed. The proposed algorithm has been implemented in this simulated environment. After fine tuning the algorithm, it has been tested in various shop conditions. The results of these simulation studies are summarized.     

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.     

A Virtual Cellular Manufacturing Approach to Batch Production*

In this paper, Virtual Cellular Manufacturing (VCM), an alternative approach to implementing cellular manufacturing, is investigated. VCM combines the setup efficiency typically obtained by Group Technology (GT) cellular manufacturing (CM) systems with the routing flexibility of a job shop. Unlike traditional CM systems in which the shop is physically designed as a series of cells, family-based scheduling criteria are used to form logical cells within a shop using a process layout. The result is the formation of temporary, virtual cells as opposed to the more traditional, permanent, physical cells present in GT systems. Virtual cells allow the shop to be more responsive to changes in demand and workload patterns. Production using VCM is compared to production using traditional cellular and job shop approaches. Results indicate that VCM yields significantly better flow time and due date performance over a wide range of common operating conditions, as well as being more robust to demand variability.     

Dynamic scheduling of manufacturing job shops using extreme value theory

Most job shop scheduling approaches reported in the literature assume that the scheduling problem is static (i.e. job arrivals and the breakdowns of machines are neglected) and in addition, these scheduling approaches may not address multiple criteria scheduling or accommodate alternate resources to process a job operation. In this paper, a scheduling method based on extreme value theory (SEVAT) is developed and addresses all the shortcomings mentioned above. The SEVAT approach creates a statistical profile of schedules through random sampling, and predicts the quality or 'potential' of a feasible schedule. A dynamic scheduling problem was designed to reflect a real job shop scheduling environment closely. Two performance measures, viz. mean job tardiness and mean job cost, were used to demonstrate multiple criteria scheduling. Three factors were identified, and varied between two levels each, thereby spanning a varied job shop environment. The results of this extensive simulation study show that the SEVAT scheduling approach produces a better performance compared to several common dispatching rules.     

THE IMPACT OF SIMPLE PRIORITY RULE COMBINATIONS ON DELIVERY SPEED AND DELIVERY RELIABILITY IN A HYBRID SHOP

This study examines the effects of using different priority rules at different stages of a multistage, flow-dominant shop. A simulation model is constructed of a manufacturing system comprised of three stages: gateway, intcrmcdiatc, and finishing. As is typical of a flow-dominant shop, the overall flow of the simulated system (gateway to intermediate to finishing) is consistent with a flow shop, but processing in the intermediate stage involves multiple work centers and resembles a job shop. Shop performance is observed when four well-known priority heuristics are applied in different combinations in the gateway, intermediate, and finishing stages of the process. Multiple performance measures addressing the strategic objectives of delivery speed and delivery reliability are recorded under two different shop load conditions. Results show that the measures of both delivery speed and delivery reliability are affected by the priority rule combinations, and that a tradeoff exists between average performance and consistency of performance. Certain priority rule combinations affect performance in predictable ways, allowing the user to assess tradeoffs between delivery speed and delivery reliability.