Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Entire DC Network
Dynamic Scheduling With Uncertain Job Types, Zuo-Jun Max Shen, Jingui Xie, Zhichao Zheng, Han Zhou
Dynamic Scheduling With Uncertain Job Types, Zuo-Jun Max Shen, Jingui Xie, Zhichao Zheng, Han Zhou
Research Collection Lee Kong Chian School Of Business
Uncertain job types can arise as a result of predictive or diagnostic inaccuracy in healthcare or repair service systems and unknown preferences in matching service systems. In this paper, we study systems with multiple types of jobs, in which type information is imperfect and will be updated dynamically. Each job has a prior probability of belonging to a certain type which may be predicted by data, models, or experts. A job can only be processed by the right machine, and a job assigned to the wrong machine must be rescheduled. More information is learned from the mismatch, and job type …
Limousine Service Management: Capacity Planning With Predictive Analytics And Optimization, Peng Liu, Ying Chen, Chung-Piaw Teo
Limousine Service Management: Capacity Planning With Predictive Analytics And Optimization, Peng Liu, Ying Chen, Chung-Piaw Teo
Research Collection Lee Kong Chian School Of Business
The limousine service in luxury hotels is an integral component of the whole customer journey in the hospitality industry. One of the largest hotels in Singapore manages a fleet of both in-house and outsourced vehicles around the clock, serving 9,000 trips per month on average. The need for vehicles may scale up rapidly, especially during special events and festive periods in the country. The excess demand is met by having additional outsourced vehicles on standby, incurring millions of dollars of additional expenses per year for the hotel. Determining the required number of limousines by hour of the day is a …
Ad Revenue Optimization In Live Broadcasting, Dana G. Popescu, Pascale Crama
Ad Revenue Optimization In Live Broadcasting, Dana G. Popescu, Pascale Crama
Research Collection Lee Kong Chian School Of Business
In live broadcasting, the break lengths available for commercials are not always fixed and known in advance (e.g., strategic and injury time-outs are of variable duration in live sports transmissions). Broadcasters actively manage their advertising revenue by jointly optimizing sales and scheduling policies. We characterize the optimal dynamic schedule in a simplified setting that incorporates stochastic break durations and advertisement lengths of 15 and 30 seconds. The optimal policy is a "greedy" look-ahead rule that accounts for the remaining number of breaks; in this setting, there is no value to perfect information at the scheduling stage, and hence knowing the …
Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa
Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa
Research Collection Lee Kong Chian School Of Business
This paper was motivated by an observation in an international airport with regard to allocation of resources for check-in counters. In an exclusive check-in counter system, each flight has a dedicated number of counters that will be open until at least a half-hour before the scheduled departure of that flight. Currently, in many of the airports around the world, the decision to open or close check-in counters is done on an ad hoc basis by human schedulers. In doing so, the schedulers are almost always forced to perform a balancing act in meeting the quality of service stipulated by the …
R&D Project Scheduling When Activities May Fail, Bert De Reyck, Roel Leus
R&D Project Scheduling When Activities May Fail, Bert De Reyck, Roel Leus
Research Collection Lee Kong Chian School Of Business
An R&D project typically consists of several stages. Due to technological risks, the project may have to be terminated before completion, each stage having a specific likelihood of success. In the project planning and scheduling literature, this technological uncertainty has typically been ignored and project plans are developed only for scenarios in which the project succeeds. In this paper we examine how to schedule projects in order to maximize their expected net present value when the project activities have a probability of failure and when an activity's failure leads to overall project termination. We formulate the problem, show that it …
Mabs: Spreadsheet– Based Decision Support For Precision Marketing, Bert De Reyck, Zeger Degraeve
Mabs: Spreadsheet– Based Decision Support For Precision Marketing, Bert De Reyck, Zeger Degraeve
Research Collection Lee Kong Chian School Of Business
In this paper, we describe a decision support system developed for automatically scheduling and optimising broadcasts of advertisements to mobile phones via SMS (Short Message Service) text messaging. The system, MABS or “Mobile Advertising Broadcast Scheduler”, is developed in Microsoft Excel with a link to Lingo, a modelling language and IP solver. It was developed for a London-based company specialized in location-sensitive precision marketing via mobile phones. The system significantly reduced the time required to schedule the broadcasts, and resulted both in increased customer response and revenues.
Nurse Rostering Problems: A Bibliographic Survey, Brenda Cheang, Haibing Li, Andrew Lim, Brian Rodrigues
Nurse Rostering Problems: A Bibliographic Survey, Brenda Cheang, Haibing Li, Andrew Lim, Brian Rodrigues
Research Collection Lee Kong Chian School Of Business
Hospitals need to repeatedly produce duty rosters for its nursing staff. The good scheduling of nurses has impact on the quality of health care, the recruitment of nurses, the development of budgets and other nursing functions. The nurse rostering problem (NRP) has been the subject of much study. This paper presents a brief overview, in the form of a bibliographic survey, of the many models and methodologies available to solve the NRP.
Phase Transitions In Project Scheduling, Willy Herroelen, Bert De Reyck
Phase Transitions In Project Scheduling, Willy Herroelen, Bert De Reyck
Research Collection Lee Kong Chian School Of Business
Researchers in the area of artificial intelligence have recently shown that many NP-complete problems exhibit phase transitions. Often, problem instances change from being easy to being hard to solve to again being easy to solve when certain of their characteristics are modified. Most often the transitions are sharp, but sometimes they are rather continuous in the order parameters that are characteristic of the system as a whole. To the best of our knowledge, no evidence has been provided so far that similar phase transitions occur in NP-hard scheduling problems. In this paper we report on the existence of phase transitions …