Human-Machine Collaborative Optimization via Apprenticeship Scheduling

Coordinating agents to complete a set of tasks with intercoupled temporal and resource constraints is computationally challenging, yet human domain experts can solve these difficult scheduling problems using paradigms learned through years of apprenticeship. A process for manually codifying this domain knowledge within a computational framework is necessary to scale beyond the ``single-expert, single-trainee" apprenticeship model. However, human domain experts often have difficulty describing their decision-making processes, causing the codification of this knowledge to become laborious. We propose a new approach for capturing domain-expert heuristics through a pairwise ranking formulation. Our approach is model-free and does not require enumerating or iterating through a large state space. We empirically demonstrate that this approach accurately learns multifaceted heuristics on a synthetic data set incorporating job-shop scheduling and vehicle routing problems, as well as on two real-world data sets consisting of demonstrations of experts solving a weapon-to-target assignment problem and a hospital resource allocation problem. We also demonstrate that policies learned from human scheduling demonstration via apprenticeship learning can substantially improve the efficiency of a branch-and-bound search for an optimal schedule. We employ this human-machine collaborative optimization technique on a variant of the weapon-to-target assignment problem. We demonstrate that this technique generates solutions substantially superior to those produced by human domain experts at a rate up to 9.5 times faster than an optimization approach and can be applied to optimally solve problems twice as complex as those solved by a human demonstrator.Comment: Portions of this paper were published in the Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) in 2016 and in the Proceedings of Robotics: Science and Systems (RSS) in 2016. The paper consists of 50 pages with 11 figures and 4 table

Automated Diagnosis of Clinic Workflows

Outpatient clinics often run behind schedule due to patients who arrive late or appointments that run longer than expected. We sought to develop a generalizable method that would allow healthcare providers to diagnose problems in workflow that disrupt the schedule on any given provider clinic day. We use a constraint optimization problem to identify the least number of appointment modifications that make the rest of the schedule run on-time. We apply this method to an outpatient clinic at Vanderbilt. For patient seen in this clinic between March 27, 2017 and April 21, 2017, long cycle times tended to affect the overall schedule more than late patients. Results from this workflow diagnosis method could be used to inform interventions to help clinics run smoothly, thus decreasing patient wait times and increasing provider utilization

An Automatic and Intelligent System for Integrated Healthcare Processes Management

In this work, an automatic and intelligent system for integrated healthcare processes management is developed on a constraint based system. This project has been carried out in collaboration with a real assisted repro-duction clinic. Our goal is to improve the efficiency of the clinic by facilitating the management of the integrated healthcare system. This is very important in an environment in which the healthcare processes present complex temporal and resource constraints.Ministerio de Economía y Competitividad TIN2016-76956-C3-2-RMinisterio de Economía y Competitividad TIN2015-71938-RED

Application of Quantum Annealing to Nurse Scheduling Problem

Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate the empirical performance of quantum annealing to solve the Nurse Scheduling Problem (NSP) with hard constraints using the D-Wave 2000Q quantum annealing device. NSP seeks the optimal assignment for a set of nurses to shifts under an accompanying set of constraints on schedule and personnel. After reducing NSP to a novel Ising-type Hamiltonian, we evaluate the solution quality obtained from the D-Wave 2000Q against the constraint requirements as well as the diversity of solutions. For the test problems explored here, our results indicate that quantum annealing recovers satisfying solutions for NSP and suggests the heuristic method is sufficient for practical use. Moreover, we observe that solution quality can be greatly improved through the use of reverse annealing, in which it is possible to refine a returned results by using the annealing process a second time. We compare the performance NSP using both forward and reverse annealing methods and describe how these approach might be used in practice.Comment: 20 pages, 13 figure

Finding regions of local repair in hierarchical constraint satisfaction

Algorithms for solving constraint satisfaction problems (CSP) have been successfully applied to several fields including scheduling, design, and planning. Latest extensions of the standard CSP to constraint optimization problems (COP) additionally provided new opportunities for solving several problems of combinatorial optimization more efficiently. Basically, two classes of algorithms have been used for searching constraint satisfaction problems (CSP): local search methods and systematic tree search extended by the classical constraint-processing techniques like e.g. forward checking and backmarking. Both classes exhibit characteristic advantages and drawbacks. This report presents a novel approach for solving constraint optimization problems that combines the advantages of local search and tree search algorithms which have been extended by constraint-processing techniques. This method proved applicability in a commercial nurse scheduling system as well as on randomly generated problems

The SEC-system : reuse support for scheduling system development

Recently, in a joint cooperation of Stichting VNA, SAL Apotheken, the Faculty of Management and Organization, and the University Centre for Pharmacy, University of Groningen in the Netherlands, a Ph.D-study started regarding Apot(he)ek, Organization and Management (APOM). The APOM-project deals with the structuring and steering of pharmacy organization. The manageability of the internal pharmacy organization, and the manageability of the direct environment of pharmacy organization is the subject matter. The theoretical background of the APOM-project is described. A literature study was made to find mixes of objectives. Three mixes of objectives in pharmacy organization are postulated; the product mix, the process mix, and the customer mix. The typology will be used as a basic starting point for the empirical study in the next phase of the APOM-project.

Improving workforce scheduling of aircraft line maintenance at Sabena Technics.

This paper presents our application of a visualization tool and optimization model based on mixed-integer linear programming to solve a workforce staffing and scheduling problem at Sabena Technics, a major aircraft maintenance company in Belgium. We used the software to generate many alternative, cost-efficient schedules and to analyze multiple scenarios. In several management meetings, takeholders evaluated the schedules and raised concerns. We subsequently changed the model to successfully address their concerns. The model has resulted in considerable savings and a more efficient use of human resources.Workforce staffing; Scheduling; Optimization; Visualization; Aircraft maintenance;

A Partial Taxonomy of Substitutability and Interchangeability

Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the different concepts, and indicate directions for future work, in particular with respect to making connections with research into symmetry breaking. This paper is a condensed version of a larger work in progress.Comment: 18 pages, The 10th International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon'10