Stabilized‐Cycle Strategy for Capacitated Lot Sizing with Multiple Products: Fill‐Rate Constraints in Rolling Schedules

In practice, deterministic, multi‐period lot‐sizing models are implemented in rolling schedules since this allows the revision of decisions beyond the frozen horizon. Thus, rolling schedules are able to take realizations and updated forecasts of uncertain data (e.g., customer demands) into account. Furthermore, it is common to hold safety stocks to ensure given service levels (e.g., fill rate). As we will show, this approach, implemented in rolling schedules, often results in increased setup and holding costs while (over‐)accomplishing given fill rates. A well‐known alternative to deterministic planning models are stochastic, static, multi‐period planning models used in the static uncertainty strategy, which results in stable plans. However, these models have a lack of flexibility to react to the realization of uncertain data. As a result, actual costs may differ widely from planned costs, and downside deviations of actual fill rates from those given are very high. We propose a new strategy, namely the stabilized cycle. This combines and expands upon ideas from the literature for minimizing setup and holding costs in rolling schedules, while controlling actual product‐specific fill rates for a finite reporting period. A computational study with a multi‐item capacitated medium‐term production planning model has been executed in rolling schedules. On the one hand, it demonstrates that the stabilized‐cycle strategy yields a good compromise between costs and downside deviations. Furthermore, the stabilized‐cycle strategy weakly dominates the order‐based strategy for both constant and seasonal demands.     

On‐Call Overtime for Service Workforce Scheduling when Demand Is Uncertain

This article builds on prior research to develop shift scheduling models that include on‐call overtime for service environments where demand is uncertain. The research is motivated by recent developments in nurse scheduling, such as laws prohibiting mandatory overtime and the popularity of self‐scheduling systems. For single‐period scenarios, models are developed, solution methods are described, and results are explored for a variety of environments. Results show that the use of on‐call overtime can reduce costs slightly, with the amount of savings dependent on characteristics of the scheduling environment. The factor that most significantly affects cost savings is the cost of outside agency workers relative to overtime workers. In addition to lowering costs, on‐call overtime greatly reduces reliance on outside agency workers, which can have important practical implications in terms of quality of service and workforce morale. Results based on single‐period models motivate multiperiod formulations for single‐ and multidepartment scenarios, and solution methods are outlined for those cases. The possibility of using multiperiod models within a rolling horizon framework with forecast updating is discussed. This goes along with an extension of the traditional workforce management hierarchy that separates overtime and regular‐time scheduling, as seen in practice with self‐scheduling and shift‐bidding systems.     

Schedule Recovery: Unplanned Absences in Service Operations*

The U.S. service sector loses 2.3% of all scheduled labor hours to unplanned absences, but in some industries, the total cost of unplanned absences approaches 20% of payroll expense. The principal reasons for unscheduled absences (personal illness and family issues) are unlikely to abate anytime soon. Despite this, most labor scheduling systems continue to assume perfect attendance. This oversight masks an important but rarely addressed issue in services management: how to recover from short‐notice, short‐term reductions in planned capacity. In this article, we model optimal responses to unplanned employee absences in multi‐server queueing systems that provide discrete, pay‐per‐use services for impatient customers. Our goal is to assess the performance of alternate absence recovery strategies under various staffing and scheduling regimes. We accomplish this by first developing optimal labor schedules for hypothetical service environments with unreliable workers. We then simulate unplanned employee absences, apply an absence recovery model, and compute system profits. Our absence recovery model utilizes recovery strategies such as holdover overtime, call‐ins, and temporary workers. We find that holdover overtime is an effective absence recovery strategy provided sufficient reserve capacity (maximum allowable work hours minus scheduled hours) exists. Otherwise, less precise and more costly absence recovery methods such as call‐ins and temporary help service workers may be needed. We also find that choices for initial staffing and scheduling policies, such as planned overtime and absence anticipation, significantly influence the likelihood of successful absence recovery. To predict the effectiveness of absence recovery policies under alternate staffing/scheduling strategies and operating environments, we propose an index based on initial capacity reserves.     

A Stochastic Goal Program for Employee Scheduling*

Deterministic goal programs for employee scheduling decisions attempt to minimize expected operating costs by assigning the ideal number of employees to each feasible schedule. For each period in the planning horizon, managers must first determine the amount of labor that should be scheduled for duty. These requirements are often established with marginal analysis techniques, which use estimates for incremental labor costs and shortage expenses. Typically, each period in the planning horizon is evaluated as an independent epoch. An implicit assumption is that individual employees can be assigned to schedules with as little as a single period of work. If this assumption violates local work rules, the labor requirements parameters for the deterministic goal program may be suboptimal. As we show in this research, this well-known limitation can lead to costly staffing and scheduling errors. We propose an employee scheduling model that overcomes this limitation by integrating the labor requirements and scheduling decisions. Instead of a single, externally determined staffing goal for each period, the model uses a probability distribution for the quantity of labor required. The model is free to choose an appropriate staffing level for each period, eliminating the need for a separate goal-setting procedure. In most cases this results in better, less costly decisions. In addition, the proposed model easily accommodates both linear and nonlinear under- and overstaffing penalties. We use simple examples to demonstrate many of these advantages and to illustrate the key techniques necessary to implement our model. We also assess its performance in a study of more than 1,700 simulated stochastic employee scheduling problems.     

A METHODOLOGY FOR LABOR SCHEDULING IN A SERVICE OPERATING SYSTEM

In the increasingly competitive services sector, utilization of the labor force can make the difference between profits or losses. Until recently, service operations managers had a limited set of tools, most of them computer-based, for scheduling labor. This paper offers a manual heuristic for labor scheduling that outperforms traditional algorithmic solution approaches. Specifically, this study examines the problem of scheduling employees in service delivery system subject to demand variability. The manual heuristic proposed asigns full-time empolyees to weekly work schedules with the objective of minimizing the total number of labor hours scheduled. The performance of the manual heuristic is compared to the classical algorithmic solution and to a lower bound for a variety of demand distributions and system operating conditions. The heuristic is shown to produce a smaller work force than the classical approach in 106 of the 108 demand-operating condition patterns examined.     

Staffing and scheduling flexible call centers by two-stage robust optimization

We study the shift scheduling problem in a multi-shift, flexible call center. Differently from previous approaches, the staffing levels ensuring the desired quality of service are considered uncertain, leading to a two-stage robust integer program with right-hand-side uncertainty. We show that, in our setting, modeling the correlation of the demands in consecutive time slots is easier than in other staffing approaches. The complexity issues of a Benders type reformulation are investigated and a branch-and-cut algorithm is devised. The approach can efficiently solve real-world problems from an Italian call center and effectively support managers decisions. In fact, we show that robust shifts have very similar costs to those evaluated by the traditional (deterministic) method while ensuring a higher level of protection against uncertainty.     

Priority Rules for Multi‐Task Due‐Date Scheduling under Varying Processing Costs

We study the scheduling of multiple tasks under varying processing costs and derive a priority rule for optimal scheduling policies. Each task has a due date, and a non‐completion penalty cost is incurred if the task is not completely processed before its due date. We assume that the task arrival process is stochastic and the processing rate is capacitated. Our work is motivated by both traditional and emerging application domains, such as construction industry and freelance consulting industry. We establish the optimality of Shorter Slack time and Longer remaining Processing time (SSLP) principle that determines the priority among active tasks. Based on the derived structural properties, we also propose an effective cost‐balancing heuristic policy and demonstrate the efficacy of the proposed policy through extensive numerical experiments. We believe our results provide operators/managers valuable insights on how to devise effective service scheduling policies under varying costs.     

Equivalent Alternate Solutions for the Tour Scheduling Problem*

Achieving minimum staffing costs, maximum employee satisfaction with their assigned schedules, and acceptable levels of service are important but potentially conflicting objectives when scheduling service employees. Existing employee scheduling models, such as tour scheduling or general employee scheduling, address at most two of these criteria. This paper describes a heuristic to improve tour scheduling solutions provided by other procedures, and generate a set of equivalent cost feasible alternatives. These alternatives allow managers to identify solutions with attractive secondary characteristics, such as overall employee satisfaction with their assigned tours or consistent employee workloads and customer response times. Tests with both full-time and mixed work force problems reveal the method improves most nonoptimal initial heuristic solutions. Many of the alternatives generated had more even distributions of surplus staff than the initial solutions, yielding more consistent customer response times and employee workloads. The likelihood of satisfying employee scheduling preferences may also be increased since each alternative provides a different deployment of employees among the available schedules.     

Staffing Call Centers with Uncertain Arrival Rates and Co‐sourcing

In a call center, staffing decisions must be made before the call arrival rate is known with certainty. Once the arrival rate becomes known, the call center may be over‐staffed, in which case staff are being paid to be idle, or under‐staffed, in which case many callers hang‐up in the face of long wait times. Firms that have chosen to keep their call center operations in‐house can mitigate this problem by co‐sourcing; that is, by sometimes outsourcing calls. Then, the required staffing N depends on how the firm chooses which calls to outsource in real time, after the arrival rate realizes and the call center operates as a M/M/N + M queue with an outsourcing option. Our objective is to find a joint policy for staffing and call outsourcing that minimizes the long‐run average cost of this two‐stage stochastic program when there is a linear staffing cost per unit time and linear costs associated with abandonments and outsourcing. We propose a policy that uses a square‐root safety staffing rule, and outsources calls in accordance with a threshold rule that characterizes when the system is “too crowded.” Analytically, we establish that our proposed policy is asymptotically optimal, as the mean arrival rate becomes large, when the level of uncertainty in the arrival rate is of the same order as the inherent system fluctuations in the number of waiting customers for a known arrival rate. Through an extensive numerical study, we establish that our policy is extremely robust. In particular, our policy performs remarkably well over a wide range of parameters, and far beyond where it is proved to be asymptotically optimal.     

Strategies for Addressing the Nursing Shortage: Coordinated Decision Making and Workforce Flexibility

In this article, we present strategies to help combat the U.S. nursing shortage. Key considerations include providing an attractive work schedule and work environment—critical issues for retaining existing nurses and attracting new nurses to the profession—while at the same time using the set of available nurses as effectively as possible. Based on these ideas, we develop a model that takes advantage of coordinated decision making when managing a flexible workforce. The model coordinates scheduling, schedule adjustment, and agency nurse decisions across various nurse labor pools, each of differing flexibility levels, capabilities, and costs, allowing a much more desirable schedule to be constructed. Our primary findings regarding coordinated decision making and how it can be used to help address the nursing shortage include (i) labor costs can be reduced substantially because, without coordination, labor costs on average are 16.3% higher based on an actual hospital setting, leading to the availability of additional funds for retaining and attracting nurses, (ii) simultaneous to this reduction in costs, more attractive schedules can be provided to the nurses in terms of less overtime and fewer undesirable shifts, and (iii) the use of agency nurses can help avoid overtime for permanent staff with only a 0.7% increase in staffing costs. In addition, we estimate the cost of the shortage for a typical U.S. hospital from a labor cost perspective and show how that cost can be reduced when managers coordinate.     

Centralized nurse scheduling to simultaneously improve schedule cost and nurse satisfaction

Nursing managers are faced with rising turnover and shortages of qualified nursing staff. At the same time they are under increased pressure to simultaneously increase patient care and satisfaction while reducing costs. In this study, we examine the impact of centralizing scheduling decisions across departments in a hospital. By pooling nurses from multiple units and scheduling them in one model, improved costs and reduced overtime result. Reduced overtime improves schedules for nurses. Improved satisfaction levels can positively impact turnover rates among nurses. Our results show that by using a centralized model, nursing managers in hospitals can improve the desirability of nurse schedules by approximately 34% and reduce overtime by approximately 80% while simultaneously reducing costs by just under 11%.     

Centralized nurse scheduling to simultaneously improve schedule cost and nurse satisfaction

Nursing managers are faced with rising turnover and shortages of qualified nursing staff. At the same time they are under increased pressure to simultaneously increase patient care and satisfaction while reducing costs. In this study, we examine the impact of centralizing scheduling decisions across departments in a hospital. By pooling nurses from multiple units and scheduling them in one model, improved costs and reduced overtime result. Reduced overtime improves schedules for nurses. Improved satisfaction levels can positively impact turnover rates among nurses. Our results show that by using a centralized model, nursing managers in hospitals can improve the desirability of nurse schedules by approximately 34% and reduce overtime by approximately 80% while simultaneously reducing costs by just under 11%.     

Reserving Capacity for Urgent Patients in Primary Care

This paper examines the effect of the common practice of reserving slots for urgent patients in a primary health care practice on two service quality measures: the average number of urgent patients that are not handled during normal hours (either handled as overtime, referred to other physicians, or referred to the emergency room) and the average queue of non‐urgent or routine patients. We formulate a stochastic model of appointment scheduling in a primary care practice. We conduct numerical experiments to optimize the performance of this system accounting for revenue and these two service quality measures as a function of the number of reserved slots for urgent patients. We compare traditional methods with the advanced‐access system advocated by some physicians, in which urgent slots are not reserved, and evaluate the conditions under which alternative appointment scheduling mechanisms are optimal. Finally, we demonstrate the importance of patient arrival dynamics to their relative performance finding that encouraging routine patients to call for same‐day appointments is a key ingredient for the success of advanced‐access.     

The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research

Call centers are an increasingly important part of today's business world, employing millions of agents across the globe and serving as a primary customer‐facing channel for firms in many different industries. Call centers have been a fertile area for operations management researchers in several domains, including forecasting, capacity planning, queueing, and personnel scheduling. In addition, as telecommunications and information technology have advanced over the past several years, the operational challenges faced by call center managers have become more complicated. Issues associated with human resources management, sales, and marketing have also become increasingly relevant to call center operations and associated academic research. In this paper, we provide a survey of the recent literature on call center operations management. Along with traditional research areas, we pay special attention to new management challenges that have been caused by emerging technologies, to behavioral issues associated with both call center agents and customers, and to the interface between call center operations and sales and marketing. We identify a handful of broad themes for future investigation while also pointing out several very specific research opportunities.     

Sequencing and Scheduling Appointments with Potential Call‐In Patients

This paper studies appointment scheduling for a combination of routine patients who book well in advance and last‐minute patients who call for an appointment later that same day. We determine when these same‐day patients should be scheduled throughout the day, and how the prospect of their arrivals affects the appointment times of the routine patients. By formulating the problem as a stochastic linear program, we are able to incorporate random and heterogeneous service times and no‐show rates, ancillary physician tasks, and appointment delay costs for same‐day patients who prefer to see the doctor as early as possible. We find that the optimal patient sequence is quite sensitive to the no‐show probabilities and the expected number of same‐day patients. We also develop two simple heuristic solutions to this combinatorial sequencing problem.     

Real‐Time Work Schedule Adjustment Decisions: An Investigation and Evaluation

Service managers often find that available worker capacity does not match with actual demand during a given day. They then must attempt to modify the planned work schedule to improve service and increase profitability. This study, which defines such a setting as the real‐time work schedule adjustment decision, pr oposes mathematical formulations of the real‐time adjustment and develops efficient heuristic approaches for this decision. The study evaluates the relative effectiveness of these heuristics versus experienced service managers, investigates the effect of the degree of schedule adjustment on profitability, and assesses the effect of demand forecast update errors on the performance of the schedule adjustment efforts. First, the results indicate that the computer based heuristics achieve higher profit improvement than experienced managers. Second, there is a trade‐off between schedule stability and profitability so that more extensive schedule revisions (efficiency first heuristics) generally result in higher profitability. However, the incremental return on schedule changes is diminishing. Third, we find that active adjustments of work schedules are beneficial as long as the direction of demand change is accurately identified.     

Real-time schedule adjustment decisions: a case study

Service capacity management has been extensively studied and successfully applied in many industries, with an emphasis on tour/shift scheduling and assignment decisions. However, few studies have addressed real-time work schedule adjustment decisions made necessary by demand uncertainty and/or labor supply disruption. This case study deals with the real-time work schedule adjustment decision and investigates the association of managerial experience, workforce mix (full- and part-time staff), and information accuracy with managers’ adjustment decisions. We designed an experiment that involved practicing service managers from a McDonald's franchise who provided their adjustment decisions for a given set of test scenarios. Their decisions were analyzed and evaluated via a controlled experiment. Using profitability as the primary performance measure, the study identifies the following outcomes: First, senior managers of a store with a higher proportion of part-time staff made more adjustments and attained slightly higher profitability than junior managers, when all employees accepted adjusted schedules. Second, managers of a store with a higher proportion of part-time staff were able to make slightly higher profits, particularly when capacity shortages occurred. And third, to achieve the majority of the benefits from schedule adjustments, it is sufficient to search for information that correctly identifies the direction of demand changes, rather than identifying the exact magnitude of the changes.     

A SIMULATION GAME FOR TEACHING SERVICE‐ORIENTED SUPPLY CHAIN MANAGEMENT: DOES INFORMATION SHARING HELP MANAGERS WITH SERVICE CAPACITY DECISIONS?*

For decades, the Beer Game has taught complex principles of supply chain management in a finished good inventory supply chain. However, services typically cannot hold inventory and can only manage backlogs through capacity adjustments. We propose a simulation game designed to teach service‐oriented supply chain management principles and to test whether managers use them effectively. For example, using a sample of typical student results, we determine that student managers can effectively use end‐user demand information to reduce backlog and capacity adjustment costs. The game can also demonstrate the impact of demand variability and reduced capacity adjustment time and lead times.     

Optimal Configuration of a Service Delivery Network: An Application to a Financial Services Provider

Driven by market pressures, financial service firms are increasingly partnering with independent vendors to create service networks that deliver greater profits while ensuring high service quality. In the management of call center networks, these partnerships are common and form an integral part of the customer care and marketing strategies in the financial services industry. For a financial services firm, configuring such a call center service network entails determining which partners to select and how to distribute service requests among vendors, while incorporating their capabilities, costs, and revenue‐generating abilities. Motivated by a problem facing a Fortune 500 financial services provider, we develop and apply a novel mixed integer programming model for the service network configuration problem. Our tactical decision support model effectively accounts for the firm's costs by capturing the impact of service requirements on vendor staffing levels and seat requirements, and permits imposing call routing preferences and auxiliary service costs. We implemented the model and applied it to data from an industry partner. Results suggest that our approach can generate considerable cost savings and substantial additional revenues, while ensuring high service quality. Results based on test instances demonstrate similar savings and outperform two rule‐based methods for vendor assignment.     

中小呼叫中心月度排班优化模型与算法

国内中小呼叫中心制定坐席人员月度排班表时,通常考虑劳动法规合同约束和体现企业自身用工管理诉求。构建坐席人员月度排班优化问题的二次整数规划模型。鉴于问题模型难解性,依据调研企业需求和模型逻辑结构分析,把问题分解成三个子问题。通过构建整数规划模型和提出启发式算法来求出子问题解,从而生成排班问题优化解。问题实例计算表明,模型算法能够有效控制人力成本和兼顾员工同班次管理目标。与周排班方法比较,该方法能够充分体现月度排班人力灵活性来实现人力优化配置。