Name
Abstract | ||
|---|---|---|
Today's manufacturing systems are typically complex cyber-physical systems where the physical and control aspects interact with the scheduling decisions. Optimizing such facilities requires ordering jobs and configuring the manufacturing system for each job. This optimization problem can be described as a Multi-Objective Generalized TSP where conflicting objectives lead to a trade-off space. This is the first work to address this TSP variant, introducing a compositional heuristic suitable to online application. |
Year | Venue | Field |
|---|---|---|
2016 | DATE | Heuristic,Mathematical optimization,Job shop scheduling,Computer science,Scheduling (computing),Operations research,Multi-objective optimization,Travelling salesman problem,Information and Communications Technology,Memetics,Optimization problem |
DocType | ISSN | Citations |
Conference | 1530-1591 | 1 |
PageRank | References | Authors |
0.37 | 12 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joost van Pinxten | 1 | 6 | 2.87 |
| Marc Geilen | 2 | 1346 | 84.30 |
| Twan Basten | 3 | 1833 | 132.45 |
| Umar Waqas | 4 | 10 | 2.31 |
| Lou J. Somers | 5 | 65 | 5.87 |