COMBINED PRODUCTION AND MAINTENANCE SCHEDULING FOR A MULTIPLE‐PRODUCT,SINGLE‐ MACHINE PRODUCTION SYSTEM

Traditionally, the problems of equipment maintenance scheduling and production scheduling in a multi‐product environment have been treated independently. In this paper, we develop a Markov decision process model that simultaneously determines maintenance and production schedules for a multiple‐product, single‐machine production system, accounting for the fact that equipment condition can affect the yield of different product types differently. The problem was motivated by an application in semiconductor manufacturing. After examining structural properties of the optimal policy, we compare the combined method to an approach often used in practice. In the nearly 6,000 test problems studied, the reward from the combined method was an average of more than 25 percent greater than the reward from the traditional method.     

A STUDY OF THE UTILIZATION OF CAPACITY CONSTRAINED RESOURCES IN DRUM‐BUFFER‐ROPE SYSTEMS*

Goldratt, the originator of the Theory of Constraints (TOC), maintains that only the system's primary resource constraint(s) should be scheduled at 100% of capacity. All other resources should have excess capacity. This paper presents the results of a simulation experiment that studies how changes in the capacity utilization of a systems two most heavily utilized resources affect the performance of a drum‐buffer‐rope (DBR)scheduling system. The research demonstrates that 100% utilization of the primary constraint is not optimal. It also shows that DBR responds well to relatively low levels of increased capacity at the operations second most heavily utilized resource. This research also highlights several other issues related to capacity utilization that need further investigation.     

COMMON DUE-WINDOW SCHEDULING

In this paper, we solve common due-window scheduling problems within the just-in-time window concept, i.e., scheduling problems including both earliness and tardiness penalties. We assume that jobs share the same due window and incur no penalty as long as they are completed within the due window. We further assume that the earliness and tardiness penalty factors are constant and that the size of the window is a given parameter. For cases where the location of the due window is a decision variable, we provide a polynomial algorithm with complexity O(n * log (n)) to solve the problem. For cases where the location of the due window is a given parameter, we use dynamic programming with pseudopolynomial complexity to solve the problem.     

A SINGLE-MACHINE SCHEDULING MODEL WITH FIXED-INTERVAL DELIVERIES

We consider an environment where a production facility modeled as a single machine needs to assign delivery dates to several orders and find a feasible sequence. Tardy jobs are not allowed. The delivery dates are to be at prespecified fixed intervals. The objective is to minimize the due date penalty and the cost of earliness. We provide a dynamic programming-based solution procedure that runs in polynomial time. We develop several dominance results that reduced the computational requirement by an order of magnitude in our computational study.     

A MARKET UTILITY‐BASED MODEL FOR CAPACITY SCHEDULING IN MASS SERVICES

Only a small set of employee scheduling articles have considered an objective of profit or contribution maximization, as opposed to the traditional objective of cost (including opportunity costs) minimization. In this article, we present one such formulation that is a market utility‐based model for planning and scheduling in mass services (MUMS). MUMS is a holistic approach to market‐based service capacity scheduling. The MUMS framework provides the structure for modeling the consequences of aligning competitive priorities and service attributes with an element of the firm's service infrastructure. We developed a new linear programming formulation for the shift‐scheduling problem that uses market share information generated by customer preferences for service attributes. The shift‐scheduling formulation within the framework of MUMS provides a business‐level model that predicts the economic impact of the employee schedule. We illustrated the shift‐scheduling model with empirical data, and then compared its results with models using service standard and productivity standard approaches. The result of the empirical analysis provides further justification for the development of the market‐based approach. Last, we discuss implications of this methodology for future research.     

LOGISTICS MANAGEMENT SYSTEM: AN ADVANCED DECISION SUPPORT SYSTEM FOR THE FOURTH DECISION TIER DISPATCH OR SHORT-INTERVAL SCHEDULING

The Logistics Management System (LMS) is a real-time transaction-based system combining decision technologies from AI, MS/OR, and decision support system that serves very successfully as a dispatcher or short-interval scheduler by monitoring and controlling the manufacturing flow of IBM's semiconductor facility near Burlington, Vermont. LMS coordinates the actions and decisions of several logically isolated participants in a serially dependent system of activities. Therefore, it balances the requirements of several goals (cycle time, output, serviceability, and inventory management) that compete for the same resource, exploits emerging opportunities on the manufacturing floor, and reduces the distortion from unplanned events. This paper provides an overview of the LMS application, the concept of interrelated decision tiers in manufacturing decision making, and the need for the dispatch decision tier to successfully reduce apparent randomness. Historically, production and operations management has ignored this decision tier. This has significantly limited our ability to make an impact on the performance of the manufacturing operation.     

PRODUCTION SCHEDULING OF CONTINUOUS FLOW LINES: MULTIPLE PRODUCTS WITH SETUP TIMES AND COSTS

The problem of production planning and setup scheduling of multiple products on a single facility is studied in this paper. The facility can only produce one product at a time. A setup is required when the production switches from one type of product to another. Both setup times and setup costs are considered. The objective is to determine the setup schedule and production rate for each product that minimize the average total costs, which include the inventory, backlog, and setup costs. Under the assumption of a constant production rate, we obtain the optimal cyclic rotation schedule for the multiple products system. Besides the decision variables studied in the classical economic lot scheduling problem (ELSP), the production rate is also a decision variable in our model. We prove that our solutions improve the results of the classical ELSP.     

AN EXPERIMENTAL MODEL FOR INVESTIGATING THE SENSITIVITY OF JOB SHOP PERFORMANCE TO JOB RELEASE TIME DISTRIBUTION PARAMETERS

Work flows in a job shop are influenced by the load per release and time interval between release factors. We focus on the latter factor, job release times. Building on Elvers' work, this study evaluates the impact of different job release time distributions on shop performance. Using a computer simulation of a random job shop and a full factorial experimental design, we demonstrate that the type of distribution does affect performance–a finding consistent with results from job shops characterized by good shop floor control practices. These findings are explained by examining the shape and variance traits of the underlying job release time distributions.     

FREQUENCY OF REPLANNING IN A ROLLING HORIZON MASTER PRODUCTION SCHEDULE FOR A PROCESS INDUSTRY ENVIRONMENT: A CASE STUDY

This study addresses the problem of replanning frequency for a rolling horizon master production schedule (MPS) in a process industry environment under demand certainty. The major contribution of this paper is the demonstration of how the appropriate replanning frequency for a MPS can be determined under the conditions of minimum batch-size production restrictions in a rolling planning horizon setting. In addition, the problem environment for this study is an actual MPS operation that includes features such as multiple production lines, multiple products, capacity constraints, minimum inventory requirements, and multiple goals. Actual data from a paint company are used to determine the appropriate replanning frequency for a rolling horizon MPS. Results indicate that a 2-month replanning frequency was the best at this firm because of the significant cost savings it provided when compared to actual company performance and the other replanning intervals.     

AN OPTIMIZATION-BASED METHODOLOGY FOR RELEASE SCHEDULING

Operational-level scheduling decisions on the factory floor include the release policy and the dispatching rule. Recent work by researchers suggests that factory performance depends heavily on the release policy. Several heuristic factory release rules have been developed that generate release decisions based on the status of the bottleneck machine. The heuristic rules perform very well in reducing the work-in-process inventory. However, factory output schedules generated by these rules generally fail to match the demand pattern, creating excessive finished goods inventory and/or excessive backorders. To overcome these difficulties, a computationally efficient integer programming model is proposed for release scheduling.     

POM TEACHING AND RESEARCH IN THE 21st CENTURY

We offer a view of operations management in the future based on a mapping of the field's history. We discuss issues raised by this view of the future that we expect will affect those who will teach and conduct research in operations management.     

TWO‐ AND THREE‐STAGE FLOWSHOP SCHEDULING WITH NO‐WAIT IN PROCESS

In this paper we study the time complexities of some two‐ and three‐stage no‐wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP‐complete.     

ANALYSIS OF ALTERNATIVE SCHEDULING POLICIES FOR HOSPITAL NURSES

The persistent shortage of nurses adversely affects the productivity, quality of care, and operating costs in most acute care hospitals. Aggravating the shortage are high nurse turnover rates, approaching 200% in some institutions. Policies to ensure adequate staffing levels and provide more attractive work schedules are alleged to improve nurse retention. However, their cost is seldom discussed. We compared expected nursing expense and workforce requirements to staff eight medical and surgical nursing units of a large hospital for 1 month, under 12 different scheduling policies alleged to improve turnover. Using simulation and an integrated staffing and scheduling methodology, we found that the expected nursing wages and workforce requirements for some policies differed by as much as 33%. In this hospital, the expected labor costs for certain policies could erode the benefits expected from improved retention. In contrast, other policies appear to allow high utilization of nursing resources, enhancing the expected benefits of reduced turnover with significant reductions in expenses for labor, recruiting, training, and fringe benefits.     

A NOTE ON “COMMON DUE WINDOW SCHEDULING”

Kramer and Lee recently addressed a common due window scheduling problem with earliness and tardiness penalties, where earliness and tardiness penalty factors are constant and the common window size is given. They showed that the problem is polynomial when the location of the due window is a decision variable. For the case where the location of the due window is given, the problem is also polynomial when the latest due date is greater than or equal to the makespan, and they proposed a pseudopolynomial dynamic programming algorithm to find an optimal schedule when the latest due date is less than the makespan. In this note we address the problem for the case where the location of the due window is given. Specifically, we show that the problem is polynomial if the window location is unrestricted, and present a more efficient dynamic program algorithm to optimally solve the problem if the window location is restricted. The concepts of unrestricted and restricted window locations are defined in this note.     

A COMPARISON OF PRODUCTION SCHEDULING POLICIES ON COSTS,SERVICE LEVEL,AND SCHEDULE CHANGES

We consider a single product, single level, stochastic master production scheduling (Mps ) model where decisions are made under rolling planning horizons. Outcomes of interest are cost, service level, and schedule stability. The subject of this research is the Mps control system: the method used in determining the amount of stock planned for production in each time period. Typically, Mps control systems utilize a single buffer stock. Here, two Mps dual-buffer stock systems are developed and tested by simulation. We extend the data envelopment analysis (dea ) methodology to aid in the evaluation of the simulation results, where Dea serves to increase the scope of the experimental design. Results indicate that the dual-buffer control systems outperform existing policies.     

USING SHORT-TERM DEDICATION FOR SCHEDULING MULTIPLE PRODUCTS ON PARALLEL MACHINES

In a multiproduct, parallel machine environment, it may be beneficial to dedicate one or more of the machines to a single product for consecutive time periods. However, previous lot-sizing and scheduling models usually do not allow for such short-term dedication. This paper presents a mixed-integer programming model that allows for short-term dedication in scheduling parallel machines serving multiple products with dynamic demands. It also describes a Lagrangian-based algorithm for solving such scheduling problems. An experiment verifies the effectiveness of the algorithm and demonstrates the importance of allowing for short-term dedication. Capacity utilization, one of six factors investigated, greatly affects the use of dedication. A strong interaction effect between the number of machines and the number of products is also seen with respect to the usefulness of short-term dedication. A measure of estimated production frequency incorporates these two factors along with magnitudes of periodic demands. This measure has a strong relationship with the amount of short-term dedication used in solutions. Operations managers employing parallel machines could use the experimental results in deciding whether to use short-term dedication to reduce costs.     

SCHEDULING HYBRID FLOWSHOPS IN PRINTED CIRCUIT BOARD ASSEMBLY LINES*

We treat a three‐stage hybrid flowshop for the production of printed circuit boards (PCB), suggested to us by a real‐life production situation. The problem is to determine a schedule that minimizes the makespan for a given demand profile over a finite planning horizon. We propose a global procedure that utilizes genetic algorithms and three subproblems. The performance of the procedure is evaluated via experimentation over thousands of problem realizations that are randomly generated. The experimental results show the efficiency of the global procedure and provides qualitative answers to the allocation of machines to the various stages.     

A MODEL-BASED DECISION SUPPORT SYSTEM FOR SCHEDULING LUMBER DRYING OPERATIONS

Raw lumber must be dried to a specified level of moisture content before it can be used to make furniture. This paper deals with a model-based decision support system (DSS) for a local furniture manufacturing company to assist its management in scheduling lumber drying operations. In addition to buying ready-to-use dried lumber from vendors at a premium, the company processes raw lumber in house using two production process that require various lengths of processing time in predryers and dry-kilns. Given the demand for various types of dried lumber over a specified planning horizon, the processing times and costs for each production process, technological restrictions, and management policies, the problem of interest is to satisfy the demand at a minimum cost. The DSS incorporates the mathematical formulation of this problem, is user friendly, maintains model and data independence, and generates the necessary reports, including loading and unloading schedules for the equipment.     

A FRAMEWORK FOR MACHINE SCHEDULING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES

This is a study of single and parallel machine scheduling problems with controllable processing time for each job. The processing time for job j depends on the position of the job in the schedule and is a function of the number of resource units allocated to its processing. Processing time functions and processing cost functions are allowed to be nonlinear. The scheduling problems considered here have important applications in industry and include many of the existing scheduling models as special cases. For the single machine problem, the objective is minimization of total compression costs plus a scheduling measure. The scheduling measures include makespan, total flow time, total differences in completion times, total differences in waiting times, and total earliness and tardiness with a common due date for all jobs. Except when the total earliness and tardiness measure is involved, each case the problem is solved efficiently. Under an assumption typically satisfied in just-in-time systems, the problem with total earliness and tardiness measure is also solved efficiently. Finally, for a large class of processing time functions; parallel machine problems with total flow time and total earliness and tardiness measures are solved efficiently. In each case we reduce the problem to a transportation problem.     

A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES

Flowshop scheduling problems with setup times arise naturally in many practical situations. This paper provides a review of static and deterministic flowshop scheduling research involving machine setup times. The literature is classified into four broad categories, namely sequence independent job setup times, sequence dependent job setup times, sequence independent family setup times, and sequence dependent family setup times. Using the suggested classification scheme, this paper organizes the flowshop scheduling literature involving setup and/or removal times and summarizes the existing research for different flowshop problem types. This review reveals that, while a considerable body of literature on this subject has been created, there still exist several potential areas worthy of further research.