Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q322810 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OR-Library / rank | |||
Normal rank | |||
Revision as of 08:24, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem |
scientific article |
Statements
Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (English)
0 references
22 January 2015
0 references
optimization
0 references
jobshop
0 references
approximations
0 references
heuristics
0 references
