Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Tal Raviv / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6389259 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
optimization | |||
| Property / zbMATH Keywords: optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
jobshop | |||
| Property / zbMATH Keywords: jobshop / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximations | |||
| Property / zbMATH Keywords: approximations / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristics | |||
| Property / zbMATH Keywords: heuristics / rank | |||
Normal rank | |||
Revision as of 21:35, 30 June 2023
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
