6 results on '"re-scheduling"'
Search Results
2. Operating room scheduling and rescheduling: a rolling horizon approach
- Author
-
Andrea Grosso, Elena Tànfani, Giuliana Carello, Bernardetta Addis, OPTImisation Methods for Integrated SysTems (OPTIMIST), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB), Politecnico di Milano [Milan] (POLIMI), Dipartimento di Informatica [Torino], Università degli studi di Torino = University of Turin (UNITO), Dipartimento di Economia [Genova], Università degli studi di Genova = University of Genoa (UniGe), Università degli studi di Torino (UNITO), and Universita degli studi di Genova
- Subjects
0209 industrial biotechnology ,Mathematical optimization ,Schedule ,021103 operations research ,Operating room planning and scheduling ,Re-scheduling ,Robust optimization ,Rolling horizon ,Management Science and Operations Research ,Industrial and Manufacturing Engineering ,Operating room planning and scheduling, Rolling horizon, Robust optimization, Re-scheduling ,Computer science ,Tardiness ,0211 other engineering and technologies ,Time horizon ,02 engineering and technology ,[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] ,Scheduling (computing) ,Block scheduling ,020901 industrial engineering & automation ,Penalty method ,ComputingMilieux_MISCELLANEOUS ,Block (data storage) - Abstract
In this work we consider the problem of selecting a set of patients among a given waiting list of elective patients and assigning them to a set of available operating room blocks. We assume a block scheduling strategy in which the number and the length of available blocks are given. As each block is related to a specific day, by assigning a patient to a block his/her surgery date is fixed, as well. Each patient is characterized by a recommended maximum waiting time and an uncertain surgery duration. In practical applications, new patients enter the waiting list continuously. Patient selection and assignment is performed by surgery departments on a short-term, usually a week, regular base. We propose a so-called rolling horizon approach for the patient selection and assignment. At each iteration short-term patient assignment is decided. However, in a look-ahead perspective, a longer planning horizon is considered when looking for the patient selection. The mid-term assignment over the next $$n$$ weeks is generated by solving an ILP problem, minimizing a penalty function based on total waiting time and tardiness of patients. The approach is iteratively applied by shifting ahead the mid-term planning horizon. When applying the first week solution, unpredictable extensions of surgeries may disrupt the schedule. Such disruptions are recovered in the next iteration: the mid-term solution is rescheduled limiting the number of variations from the previously computed plan. Besides, the approach allows to deal with new patient arrivals. To keep limited the number of disruptions due to uncertain surgery duration, we propose also a robust formulation of the ILP problem. The deterministic and the robust formulation based frameworks are compared over a set of instances, including different stochastic realization of surgery times.
- Published
- 2016
- Full Text
- View/download PDF
3. How deals with discrete data for the reduction of simulation models using neural network
- Author
-
Philippe Thomas, André Thomas, Centre de Recherche en Automatique de Nancy (CRAN), and Université Henri Poincaré - Nancy 1 (UHP)-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
FOS: Computer and information sciences ,0209 industrial biotechnology ,Mathematical optimization ,Schedule ,Computer science ,neural network ,Supply chain ,Computer Science::Neural and Evolutionary Computation ,02 engineering and technology ,Network simulation ,Network traffic simulation ,[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] ,Reduction (complexity) ,020901 industrial engineering & automation ,[INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering ,0202 electrical engineering, electronic engineering, information engineering ,multilayer perceptron ,Pruning (decision trees) ,Neural and Evolutionary Computing (cs.NE) ,supply chain ,Artificial neural network ,Computer Science - Neural and Evolutionary Computing ,re-scheduling ,General Medicine ,simulation ,Multilayer perceptron ,Theory of constraints ,020201 artificial intelligence & image processing ,reduced model - Abstract
International audience; Simulation is useful for the evaluation of a Master Production/distribution Schedule (MPS). Also, the goal of this paper is the study of the design of a simulation model by reducing its complexity. According to theory of constraints, we want to build reduced models composed exclusively by bottlenecks and a neural network. Particularly a multilayer perceptron, is used. The structure of the network is determined by using a pruning procedure. This work focuses on the impact of discrete data on the results and compares different approaches to deal with these data. This approach is applied to sawmill internal supply chain
- Published
- 2009
4. Reduction of Product Driven System emulation models based on neural network: impact of discrete data
- Author
-
Thomas, Philippe, Thomas, André, Suhner, Marie-Christine, Centre de Recherche en Automatique de Nancy (CRAN), Université Henri Poincaré - Nancy 1 (UHP)-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), and Thomas, Philippe
- Subjects
neural network ,[INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering ,re-scheduling ,multilayer perceptron ,[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation ,simulation ,[INFO.INFO-AU] Computer Science [cs]/Automatic Control Engineering ,[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation ,reduced model ,supply chain - Abstract
International audience; Product Driven Systems (PDS) architecture needs emulation systems [13]. Discrete events simulation is then often used to build this emulation tool, but emulation model design is not a trivial task. Also, the goal of this paper is the study of the design of a simulation model by reducing its complexity. According to theory of constraints, we want to build reduced models composed exclusively by bottlenecks and a neural network. Particularly a multilayer perceptron, is used. The structure of the network is determined by using a pruning procedure. This work focuses on the impact of discrete data on the results. This approach is applied to sawmill internal supply chain.
- Published
- 2009
5. Contribution à l'étude des problèmes de ré-ordonnancement en cas de perturbation dans un système de transport de voyageurs dans une ville
- Author
-
Nguyen Duc, Khoat, Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Institut National Polytechnique de Grenoble - INPG, and Bernard Descotes-Genon(bernard.descotes-genon@inpg.fr)
- Subjects
service quality ,algorithme recuit simulé ,transport urbain ,perturbation ,urban transportation ,stratégies derégulation ,genetic algorithm ,Re-scheduling ,algorithme génétique ,control strategies ,qualité de service ,Ré-ordonnancement ,[SPI.AUTO]Engineering Sciences [physics]/Automatic - Abstract
This work of thesis on the rescheduling problems in a public transportation system of bus relates to the implementation of a system of assistance (SAD) for the regulators of the owners in their tasks of decision-making when disturbances in the operation of the public transportation system of bus occur. In this context, we developed a SAD which rests on a module of dimensioning and a module of the strategies of regulation to help the regulators in the process of planning in real time and to decrease the influences of the disturbances. The approaches by the genetic algorithm and the algorithm of simulated annealing are used for the regulation by taking account of the various constraints imposed on the system and in particular of the constraints of capacities of the buses. A new coding and new operators of crossing and change were proposed to make it possible to respect the constraints of the problem. Thus, we built an application in Visual C Sharp of the SAD proposed to end to prove its effectiveness in the event of disturbance on the public transportation system of bus.; Ce travail de thèse sur les problèmes de ré-ordonnancement dans un système de transport de bus concerne la mise en oeuvre d'un système d'aide (SAD) pour les régulateurs des exploitants dans leurs tâches de prise de décision lorsque se produisent des perturbations dans le fonctionnement du réseau de transport. Dans ce contexte, nous avons développé un SAD qui repose sur un module de dimensionnement et un module des stratégies de régulation pour aider les régulateurs dans le processus de planification en temps réel et pour diminuer les influences des perturbations. Les approches par l'algorithme génétique et l'algorithme du recuit simulé sont utilisées pour la régulation en tenant compte des diverses contraintes imposées au système et en particulier des contraintes de capacité des autobus. Un nouveau codage et de nouveaux opérateurs de croisement et de mutation ont été proposés pour permettre de respecter les contraintes du problème. Ainsi, nous avons construit une application en Visual C Sharp du SAD proposé afin de prouver son efficacité en cas de perturbation sur le réseau de transport public d'autobus.
- Published
- 2007
6. Contribution to the study of some rescheduling problems after a disturbance in a public transportation system in a city
- Author
-
Nguyen Duc, Khoat, Reynier, Patricia, Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Institut National Polytechnique de Grenoble - INPG, and Bernard Descotes-Genon(bernard.descotes-genon@inpg.fr)
- Subjects
algorithme recuit simulé ,perturbation ,urban transportation ,Re-scheduling ,control strategies ,Ré-ordonnancement ,[SPI.AUTO]Engineering Sciences [physics]/Automatic ,service quality ,[SPI.AUTO] Engineering Sciences [physics]/Automatic ,transport urbain ,stratégies derégulation ,genetic algorithm ,algorithme génétique ,qualité de service - Abstract
This work of thesis on the rescheduling problems in a public transportation system of bus relates to the implementation of a system of assistance (SAD) for the regulators of the owners in their tasks of decision-making when disturbances in the operation of the public transportation system of bus occur. In this context, we developed a SAD which rests on a module of dimensioning and a module of the strategies of regulation to help the regulators in the process of planning in real time and to decrease the influences of the disturbances. The approaches by the genetic algorithm and the algorithm of simulated annealing are used for the regulation by taking account of the various constraints imposed on the system and in particular of the constraints of capacities of the buses. A new coding and new operators of crossing and change were proposed to make it possible to respect the constraints of the problem. Thus, we built an application in Visual C Sharp of the SAD proposed to end to prove its effectiveness in the event of disturbance on the public transportation system of bus., Ce travail de thèse sur les problèmes de ré-ordonnancement dans un système de transport de bus concerne la mise en oeuvre d'un système d'aide (SAD) pour les régulateurs des exploitants dans leurs tâches de prise de décision lorsque se produisent des perturbations dans le fonctionnement du réseau de transport. Dans ce contexte, nous avons développé un SAD qui repose sur un module de dimensionnement et un module des stratégies de régulation pour aider les régulateurs dans le processus de planification en temps réel et pour diminuer les influences des perturbations. Les approches par l'algorithme génétique et l'algorithme du recuit simulé sont utilisées pour la régulation en tenant compte des diverses contraintes imposées au système et en particulier des contraintes de capacité des autobus. Un nouveau codage et de nouveaux opérateurs de croisement et de mutation ont été proposés pour permettre de respecter les contraintes du problème. Ainsi, nous avons construit une application en Visual C Sharp du SAD proposé afin de prouver son efficacité en cas de perturbation sur le réseau de transport public d'autobus.
- Published
- 2007
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.