Workload control concepts in job shops: a critical assessment

The paper considers a (static) portfolio system that satisfies adding-up contraints and the gross substitution theorem. The paper shows the relationship of the two conditions to the weak dominant diagonal property of the matrix of interest rate elasticities. This enables to investigate the impact of simultaneous changes in interest rates on the asset demands.

Capacity Planning and Leadtime management

In this paper we discuss a framework for capacity planning and lead time management in manufacturing companies, with an emphasis on the machine shop. First we show how queueing models can be used to find approximations of the mean and the variance of manufacturing shop lead times. These quantities often serve as a basis to set a fixed planned lead time in an MRP-controlled environment. A major drawback of a fixed planned lead time is the ignorance of the correlation between actual work loads and the lead times that can be realized under a limited capacity flexibility. To overcome this problem, we develop a method that determines the earliest possible completion time of any arriving job, without sacrificing the delivery performance of any other job in the shop. This earliest completion time is then taken to be the delivery date and thereby determines a workload-dependent planned lead time. We compare this capacity planning procedure with a fixed planned lead time approach (as in MRP), with a procedure in which lead times are estimated based on the amount of work in the shop, and with a workload-oriented release procedure. Numerical experiments so far show an excellent performance of the capacity planning procedure

Job shop control:in search of the key to delivery improvements

The last major performance breakthroughs in job shop control stem from the 1980s and 1990s. We generate a new search direction for designing job shop control policies, providing a key to delivery improvements. Based on a common characteristic shared by the most effective job shop control policies, we posit that control should have a specific focus during high load periods. A probability analysis reveals that substantial periods of high load are common, and even occur under assumptions of stationarity and moderate utilization. Subsequent simulations show nearly all tardy deliveries can be attributed to high load periods; and that the success of the best control policies can be explained by their ability to switch focus specifically during these periods, from reducing the dispersion of lateness to speeding up the average throughput time. Building on this, we demonstrate that for example small capacity adjustments targeted at handling high load periods can improve the percentage tardy and other delivery-related performance measures to a much greater extent than the best existing policies. Sensitivity analysis confirms the robustness of this approach and identifies a performance frontier reflecting the trade-off between capacity resources used and delivery performance realized. We conclude that a paradigm shift in job shop research is required: instead of developing single policies for application under all conditions, new policies are needed that respond differently to temporary high load periods. The new paradigm can be used as a design principle for realizing improvements across a range of planning and control decisions relevant to job shop

Efficient heuristics for the parallel blocking flow shop scheduling problem

We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows modeling the scheduling process in companies with more than one factory, each factory with a flow shop configuration. Therefore, the proposed methods can solve the scheduling problem under the blocking constraint in both situations, which, to the best of our knowledge, has not been studied previously. In this paper, we propose a mathematical model along with some constructive and improvement heuristics to solve the parallel blocking flow shop problem (PBFSP) and thus minimize the maximum completion time among lines. The proposed constructive procedures use two approaches that are totally different from those proposed in the literature. These methods are used as initial solution procedures of an iterated local search (ILS) and an iterated greedy algorithm (IGA), both of which are combined with a variable neighborhood search (VNS). The proposed constructive procedure and the improved methods take into account the characteristics of the problem. The computational evaluation demonstrates that both of them –especially the IGA– perform considerably better than those algorithms adapted from the DPFSP literature.Peer ReviewedPostprint (author's final draft

Workload control concepts in job shops:a critical assessment

The paper considers a (static) portfolio system that satisfies adding-up contraints and the gross substitution theorem. The paper shows the relationship of the two conditions to the weak dominant diagonal property of the matrix of interest rate elasticities. This enables to investigate the impact of simultaneous changes in interest rates on the asset demands

Load oriented order release (LOOR) revisited:bringing it back to the state of the art

In the workload control literature, the Load-Oriented Order Release (LOOR) approach has been neglected since its robustness was questioned at the end of the 1990s. This paper revisits LOOR and evaluates whether its performance can be improved in two ways. First, an intermediate pull release mechanism is added to avoid starvation between periodic release events. This mechanism was recently shown to be effective at improving the performance of a state-of-the-art release method known as LUMS COR. Second, an integer linear programming model is used to manage the trade-off between the timing and load balancing functions of order release. The two refinements are assessed using simulations of different shop configurations, which allow us to evaluate robustness. Results demonstrate that the refinements contribute to improving the performance of LOOR such that it can even outperform LUMS COR. Perhaps counter-intuitively, putting more emphasis on load balancing than on the urgency of individual orders is shown to lead to a lower percentage of tardy orders. Overall, the improvements mean that concerns about LOOR’s robustness are no longer valid – it now appears suitable for a wide range of shops found in practice