Inicio  /  OPERATIONS RESEARCH  /  Vol: 57 Núm: 5 Par: 0 (2009)  /  Artículo
ARTÍCULO
TITULO

Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information

Xiaoqiang Cai    
Xianyi Wu    
and Xian Zhou    

Resumen

No disponible

 Artículos similares

       
 
Yuri N. Sotskov    
Assembly lines (conveyors) are traditional means of large-scale and mass-scale productions. An assembly line balancing problem is needed for optimizing the assembly process by configuring and designing an assembly line for the same or similar types of fi... ver más
Revista: Algorithms

 
Roberto Rosario Corsini, Antonio Costa, Sergio Fichera and Vincenzo Parrinello    
This research deals with the same-day chemotherapy outpatient scheduling problem that is recognized as a leading strategy to pursue the objective of reducing patient waiting time. Inspired by a real-world context and different from the other studies, we ... ver más
Revista: Algorithms

 
Milos Seda    
The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution, and schedulin... ver más
Revista: Algorithms

 
Jingjie Gao, Hai Lan, Peng Cheng, Ying-Yi Hong and He Yin    
The operating conditions of all-electric tugboats are flexible and changeable. They are more complicated than conventional vessels in terms of joint voyages and power generation scheduling. To guarantee the reliable operation of the ship, a new coordinat... ver más

 
Chan Hee Park and Young Dae Ko    
The Korean government implemented a 52-h workweek policy for employees? welfare. Consequently, companies face workforce availability reduction with the same number of employees. That is, labor-dependent companies suffer from workforce shortage. To handle... ver más
Revista: Algorithms