Sciweavers

388 search results - page 35 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
MANSCI
2008
128views more  MANSCI 2008»
13 years 8 months ago
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
Júlíus Atlason, Marina A. Epelman, S...
EOR
2006
128views more  EOR 2006»
13 years 8 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
14 years 13 days ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
ANOR
2008
123views more  ANOR 2008»
13 years 9 months ago
An approach to predictive-reactive scheduling of parallel machines subject to disruptions
: In this paper, a new predictive-reactive approach to a parallel machine scheduling problem in the presence of uncertain disruptions is presented. The approach developed is based ...
Alejandra Duenas, Dobrila Petrovic
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
14 years 1 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...