Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-014-0376-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049093006 / rank | |||
Normal rank | |||
Revision as of 19:35, 19 March 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
