Concept explainers
It used to be that major league baseball (MLB) umpires were scheduled on an Excel spreadsheet. The task took several weeks and had to be revised often. Now they use a scheduling system developed by researchers at the University of Miami, Carnegie Mellon, and Michigan State University. A variant of the classic Traveling Salesman problem, umpires, as shown in the photo, are assigned to crews that must visit all ballparks at least once during the year. Of course, there are many more constraints.
Perspectives/Jeff Smith/Shutterstock
MLB teams play 2430 games in a two- to four-game series during a six-month season. Each game requires a crew of four umpires. There are currently 70 umpires on MLB staff, and 22 AAA umpires who may be called up as needed to fill in for games. A typical umpire will handle 142 games a year. Unlike football referees, umpires are full-time employees of MLB. Umpires are normally assigned to crews, but the content of these crews can change during the year. Constraints to umpire crew scheduling include mandated vacations, overexposure to individual teams, prohibition to refereeing at home, and minimizing coast-to-coast travel. Examples of MLB rules used to enforce these constraints are:
- Crews should travel to all 30 ballparks at least once during a season.
- Crews should not umpire the same team’s series of games more than once every 18 days.
- Crews must not travel from the West Coast to the East Coast without an intermediate day off.
- Crews must not umpire consecutive series more than 1700 miles apart without an intermediate day off.
- Crews must not travel more than 300 miles preceding a series whose first game is a day game.
- Crews should not work more than 21 days without a day off.
- Crews should see each team at home and on the road at least once.
- Crews should have balanced schedules (i.e., travel approximately the same number of miles, umpire the same number of games, and have the same number of days off).
Real-life scheduling problems, like umpire scheduling, can be quite complex. The general solution approach is similar to the assignment method of linear programming described in this chapter. There is an objective function of minimizing distance traveled subject to a number of constraints, as listed earlier. The variables are (0,1) meaning an umpire is either assigned to a game slot (i.e., 1), or not (i.e., 0), and the game slots are numerous (2430 × 4 = 9720). While this can be solved as an integer linear programming (LP) problem, the length of time to do so and the inability to relax constraints make it difficult to find a feasible solution.
Academics use heuristics, or rules of thumb, to solve these types of problems. Heuristics do not necessarily satisfy all constraints and do not guarantee an optimal solution, but they can give satisficing or “good enough” solutions. The heuristics are evaluated against performance metrics, previous solutions, and “optimal” solutions (from mathematical programming such as LP). The heuristics are usually improved on with use until users accept them. Many are then coded into software and sold as scheduling systems for particular applications.
Approximate the number of possible solutions for this problem. With computer systems able to process huge amounts of data quickly, would it be possible to enumerate all possible schedules and choose the best? Investigate.
Want to see the full answer?
Check out a sample textbook solutionChapter 17 Solutions
Operations and Supply Chain Management, 9th Edition WileyPLUS Registration Card + Loose-leaf Print Companion
Additional Business Textbook Solutions
Operations Management: Processes and Supply Chains (11th Edition)
Operations Management, Binder Ready Version: An Integrated Approach
Operations Management
Operations Management: Sustainability and Supply Chain Management (12th Edition)
Operations Management: Processes and Supply Chains (12th Edition) (What's New in Operations Management)
Principles of Operations Management: Sustainability and Supply Chain Management (10th Edition)
- Categorize different scheduling procedures for various types of service operations, such as restaurants, hospitals, and airlinesarrow_forwardAnalyze scheduling problems using priority rules and more specialized techniques.arrow_forwardDifferent scheduling methods for different types of service activities, such as restaurants, hospitals, and airlines, should be classified.arrow_forward
- How to solve scheduling issuesarrow_forwardYou are the Project Manager of a project to set up a Telecoms Infrastructure for a company. You have two options for a resource to work on a specific installation task for your project. The task is not on the critical path, but it is somewhat complex. Your options are as follows: One choice is Kwesi. He is the most skilled Engineer in the company and is therefore in constant demand. As a result, he is usually assigned to several projects at the same time. He is available to your project on a half-time basis. He currently has commitments to two other projects for the remaining half of his time. Your other choice is a team of two Engineers, both of whom have average skills. They are recent hires into the company and have never worked together before. In this option you have two alternatives and are free to choose whichever one you want. First, you could pick one of the two average skilled Engineers to work half-time on your project. Second, they could each be assigned to your project…arrow_forwardA mortgage service office has the following four activities involved in approving a loan application. Note that a working day is 8 hours and there are 60 minutes in one hour. Activity Time (minutes) A. Property survey 24 B. Credit report 19 C. Title search 18 D. Final decision 20 The office has three employees, activities A, B and C are combined together and assigned to two employees, while the other employee is responsible for the last activity D. Under this setting, what would be the maximum number of loan applications the office can process per day? Numbers only, keep three decimals if not exact, either round up or down is okarrow_forward
- Liam is estimating the schedule for all activities in the GHI Project. He is working with his project team and comparing the results of a past similar project to forecast the schedule for his current project. This is an example of which estimating approach? Group of answer choices Analogous Organizational process assets Parametric PERTarrow_forwardDescribe scheduling needs in high-volume systems.arrow_forwardGive examples of commonly used priority rules.arrow_forward
- A defense contractor in Dallas has six jobs awaiting processing. Processing time and due dates are given in the table. Assume that jobs arrive in the order shown. Compare the average completion time, utilization, average jobs in the system and average job lateness of the following scheduling rules. Start date is day 1. a) SPT: shortest processing time and b) EDD: earliest due datearrow_forwardYour team has been assigned to complete 10 client projects over the next two months. These projects and their processing times (time taken to complete a project once started, in days) are described in the table below. In addition, each project has a due-date that has been set by your internal marketing team so that the customers will be delighted with your service if you complete the project by the due-date. However, your team has only enough resources to pursue exactly one project at any given time. Once started, a project is worked through its completion and is not interrupted. As a result of the sequence in which you choose to handle projects, each project will either be on time, or late if it is completed past the due date. If a project is late, the amount of time by which it misses its due-date is called its tardiness. The objective is to pick the sequence in which to complete the projects so as to minimize the total tardiness in the schedule. What is the minimum total tardiness…arrow_forwardThe mowry machine shop still has five jobs to be processed as of 8A.M today (day 29) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in order of arrival: Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 12 4 10 B 7 3 24 C 5 10 16 D 3 8 7 E 1 4 13 Develope serpate schedules by using the FCF and EDS rules. Using FCF, the order is Using EDS, the order is The average flow time and average days past due are. Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.arrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.