Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10951-014-0376-y / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10951-014-0376-Y / rank | |||
Normal rank |
Latest revision as of 19:10, 9 December 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
0 references
0 references