Statements (49)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
cloud computing
project management service operations factory scheduling |
| gptkbp:bench |
Fisher and Thompson instances
Lawrence instances ORB instances Taillard instances |
| gptkbp:field |
computer science
industrial engineering operations research |
| gptkbp:hasStandardNotation |
J||Cmax
J||Lmax J||ΣCj J||ΣTj |
| https://www.w3.org/2000/01/rdf-schema#label |
Job-shop scheduling
|
| gptkbp:notableExample |
FT06 problem
FT10 problem LA01 problem ORB01 problem |
| gptkbp:objective |
minimize lateness
minimize makespan minimize tardiness minimize total completion time |
| gptkbp:partOf |
combinatorial optimization
scheduling theory |
| gptkbp:prohibits |
no machine processes more than one operation at a time
each job has a sequence of operations each operation assigned to a specific machine no operation can be interrupted |
| gptkbp:relatedTo |
manufacturing
scheduling production planning flow-shop scheduling open-shop scheduling permutation flow-shop scheduling resource-constrained project scheduling |
| gptkbp:solvedBy |
gptkb:simulated_annealing
heuristics integer programming constraint programming branch and bound genetic algorithm tabu search |
| gptkbp:studiedBy |
1950s
|
| gptkbp:type |
gptkb:NP-hard
|
| gptkbp:bfsParent |
gptkb:Simulated_annealing
|
| gptkbp:bfsLayer |
7
|