Xiaolan Xie - Academia.edu (original) (raw)

Papers by Xiaolan Xie

2007 IEEE International Conference on Automation Science and Engineering, 2007

To remedy lacks in modeling and analysis of health care flow, we present in this paper a new mode... more To remedy lacks in modeling and analysis of health care flow, we present in this paper a new modeling methodology for addressing organization problems of health care systems. It is a patient-centered meta-model based on three views : (i) process (pathway of patients), (ii) resource (activity of involved resources), and (iii) organization (resources relations and specializations, structure of the system). These personalized view are a powerful communication tool. The resulting meta-model can be instantiated for a specific system and immediately simulated via templates, offering a fast-prototyping tool for health care systems.

This paper addresses the design of contract-based solutions for MRI (Magnetic resonance imaging) ... more This paper addresses the design of contract-based solutions for MRI (Magnetic resonance imaging) examinations for stroke patients treated in a neurovascular department. A contract-based solution is characterized by: contracted time slots (CTS) reserved by the imaging department for the neurovascular department, advance cancellation of contracted time slots, and requests for regular time slots (RTS). The problem of CTS cancellation and RTS assignment is formulated as an average cost Markov Decision Process in order to minimize costs incurred by patient waiting times, unused CTS and CTS cancellation. Structural properties of the optimal control policies are established. Numerical results show that advance CTS cancellation significantly reduces the ratio of unused CTS with slight increase of patient waiting time.

2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236), 2001

Abstract The job shop scheduling problem (JSP) deals with the sequencing operations of a set of j... more Abstract The job shop scheduling problem (JSP) deals with the sequencing operations of a set of jobs on a set of machines with minimum cost. The flexible job shop scheduling problem (FJSP) is a generalization of the JSP, which is concerned with both the ...

Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), 2002

Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), 2001

2013 IEEE International Conference on Automation Science and Engineering (CASE), 2013

ABSTRACT This paper addresses the problem of tactical planning of mobile whole blood collection i... more ABSTRACT This paper addresses the problem of tactical planning of mobile whole blood collection in a region in order to guarantee the regional self-sufficiency over a yearly planning horizon. Two MILP models (Mixed integer linear programming) are proposed is to determine when a mobile collection must be organized at a location by taking into account human resource capacity, stock level and regulation constraints. The first model evaluates a collection plan where the number of mobile collections at each location is given. The second model has additional decision of the number of collections at each location and evaluates the amount of blood collected by taking into account demographics, donor generosity and donor availability. Numerical experiments are then performed to assess the efficiency of the proposed models with field data from the French Blood Service (EFS, Etablissement Français du Sang) in the Auvergne-Loire Region.

The timely examination is important for the outpatients to be properly diagnosed or treated. Hosp... more The timely examination is important for the outpatients to be properly diagnosed or treated. Hospital managers are under high pressure to make advance appointments for different types of outpatients to reach their waiting time target. To deal with this problem, this paper proposes a Markov Decision Process (MDP) model for scheduling the outpatients with one examination and two types of outpatients considered. The waiting time targets and rewards from accepting the outpatients of two types are different. The objective is to maximize the expected revenue. Extensive numerical experiments are used to estimate the properties of optimal policy for each type of patient. Sensitivity analysis is performed to investigate the effect of the parameters on the optimal policy and criterion.

Journal of Enterprise Information Management

Mots-clés : hospitalisation à domicile, planification multi-période, tournées de véhicules.

IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans

In this paper, we propose a new modeling methodology named MedPRO for addressing organization pro... more In this paper, we propose a new modeling methodology named MedPRO for addressing organization problems of health care systems. It is based on a metamodel with three different views: process view (care pathways of patients), resource view (activities of relevant resources), and organization view (dependence and organization of resources). The resulting metamodel can be instantiated for a specific health care system and be converted into an executable model for simulation by means of a special class of Petri nets (PNs), called Health Care Petri Nets (HCPNs). HCPN models also serve as a basis for short-term planning and scheduling of health care activities. As a result, the MedPRO methodology leads to a fast-prototyping tool for easy and rigorous modeling and simulation of health care systems. A case study is presented to show the benefits of the MedPRO methodology.

International Conference on Robotics and Automation, 2004

This work present a new class of Petri nets extended from systems of simple sequential processes ... more This work present a new class of Petri nets extended from systems of simple sequential processes with resources (S3PR)[J, Ezpeleta et al., 1995] for modeling manufacturing systems where only parts can interact with resources, and resources alone cannot interact with one another. The new class of net that is called ES3PR where deadlocks are related to unmarked siphons. ES3PR properly

IEEE Robotics & Automation Magazine, 2015

ABSTRACT This article proposes a queueing and patient pooling approach for radiotherapy capacity ... more ABSTRACT This article proposes a queueing and patient pooling approach for radiotherapy capacity allocation with heterogeneous treatment machines called linear accelerators (LINACs), different waiting time targets (WTTs), and treatment protocols. We first propose a novel queueing framework with LINAC time slots as servers. This framework leads to simple single-class queues for the evaluation of WTT satisfaction that would, otherwise, require an analysis of complicated multiclass queues with reentrance. Mixed-integer programming models are proposed for capacity allocation and case-mix optimization under WTT constraints. We then extend the queueing framework by pooling the basic patient types into groups sharing the same slot servers. A mathematical programming model and a pairwise merging heuristic are proposed for patient pooling optimization to minimize the overall LINAC capacity needed to meet all WTT requirements. Extended numerical experiments are conducted to assess the efficiency of our approach and to show the properties of optimal capacity allocation and patient pooling.

In this paper we deal with the problem of controlling a safe place/transition nets so as to avoid... more In this paper we deal with the problem of controlling a safe place/transition nets so as to avoid a set of forbidden markings F. We say that a given set of markings has property REACH if it is closed under the reachability operator. We assume that all transitions of the net are controllable and that the set of forbidden markings

2007 2nd International Conference on Pervasive Computing and Applications, 2007

Currently, the Preliminary Pervasive computing environment, such as the intelligent house, the in... more Currently, the Preliminary Pervasive computing environment, such as the intelligent house, the intelligent classroom, the intelligent office, has been realized. However, the intelligent factory based on the Pervasive computing technology is rare. Some people suggest that the wireless sensor networks can be used. But it is complex to deploy it. This paper intends to build the slightly coarse pervasive environment

Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001

We present a new deadlock prevention algorithm for a class Petri nets. A new class of net that is... more We present a new deadlock prevention algorithm for a class Petri nets. A new class of net that is extended from S3PR, called ES3PR, where deadlocks are related to unmarked siphons. This method is an iterative approach by adding two kinds of control places, called the ordinary control place and weighted control place, to the original model to prevent siphons

2013 10th IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC), 2013

ABSTRACT Weekly home health care (HHC) logistics optimization problem is considered in this paper... more ABSTRACT Weekly home health care (HHC) logistics optimization problem is considered in this paper. It extends the classical Periodic Vehicle Routing Problem with Time Windows to three types of demands of patients at home. Demands include transportation of drugs/medical devices between the HHC depot and patients' homes, delivery of special drugs from a hospital to patients, and delivery of blood samples from patients to a lab. The weekly demand of each patient is represented by a set of alternative visit patterns. Daily routing is subject to time window constraints of patients and precedence constraints of hospital and lab visits. The goal is to minimize the maximal routing costs among all routes of the week. Various combinations of tabu search and different local search schemes are used to solve the problem. Numerical results show that local search starting with an infeasible local search with a small probability followed by a feasible local search with high probability performs quite well.

Synthesis and Control of Discrete Event Systems, 2002

This paper addresses the forbidden state problem of Petri nets with liveness requirement and unco... more This paper addresses the forbidden state problem of Petri nets with liveness requirement and uncontrollable transitions. The proposed approach synthesizes in two steps an optimal Petri net-based controller, whenever such a controller exists. First, the behavior of the closed ...