Heuristic approch for solving the makespan problem in a hospital sterilization service.
Amal SoufiAnis MjirdaMourad AbedPublished in: ICALT (2014)
Keyphrases
- strongly np hard
- optimal solution
- combinatorial optimization
- timetabling problem
- scheduling jobs
- scheduling problem
- lower bound
- service oriented
- approximation algorithms
- finding an optimal solution
- web services
- unrelated parallel machines
- batch processing
- service providers
- service discovery
- processing times
- high risk
- search algorithm
- mixed integer program
- setup times
- service quality
- flowshop
- management system
- simulated annealing
- tabu search
- lagrangian relaxation
- heavy traffic
- dynamic programming
- information systems
- np hard
- constraint satisfaction
- health care
- lot streaming