Name
Abstract | ||
|---|---|---|
The flexible job-shop scheduling problem (FJSP) is one of the most popular scheduling problems, due to its relative simplicity, compared to real-world scheduling problems, and its NP-hardness. There are two types of decisions involved in solving FJSP problems: (1) assigning machines to operations, or routing, and (2) assigning a time slot in the assigned machines to the operations, or scheduling. Most approaches commit all routing (machine assignment) decisions before the scheduling process. Our proposed representation, AdRep, encodes simple heuristics, such as routing rules, instead of explicit machine assignments, delaying the explicit routing decision until absolutely necessary. This allows the scheduler to take the current state of the system into account before assigning a machine to an operation. We also utilize similar paradigms in the scheduling process. Experimental results show that our method is as capable, makespan-wise, as other published methods. Also, our method performs adequately against disruption. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1543834.1543903 | GEC Summit |
Keywords | Field | DocType |
fjsp problem,adaptive representation,assigning machine,assigned machine,published method,machine assignment,explicit machine assignment,popular scheduling problem,flexible job-shop scheduling problem,explicit routing decision,scheduling process,representation,job shop scheduling,scheduling problem,genetic algorithm | Fixed-priority pre-emptive scheduling,Mathematical optimization,Fair-share scheduling,Computer science,Flow shop scheduling,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.36 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prakarn Unachak | 1 | 1 | 0.69 |
| Erik Goodman | 2 | 145 | 15.19 |