A noncompact formulation for job-shop scheduling problems in traffic management (Q5129213)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7266026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A noncompact formulation for job-shop scheduling problems in traffic management |
scientific article; zbMATH DE number 7266026 |
Statements
A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (English)
0 references
26 October 2020
0 references
Benders' decomposition
0 references
algorithms
0 references
integer programming
0 references
transportation technology
0 references
scheduling
0 references
0 references
0.7675657272338867
0 references
0.7525831460952759
0 references
0.7449280619621277
0 references
0.7325900197029114
0 references
0.7302829027175903
0 references
