120 search results - page 5 / 24 » Genetic Programming Heuristics for Multiple Machine Scheduli... |
EUROSYS
2006
ACM
14 years 4 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
COR
2006
13 years 7 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
INFORMATICALT
2007
13 years 7 months ago
2007
This paper is concerned with an employee scheduling problem involving multiple shifts and work centers, where employees belong to a hierarchy of categories having downward substitu...
CEC
2003
IEEE
14 years 23 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...