Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics (Q336577)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics |
scientific article; zbMATH DE number 6650496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics |
scientific article; zbMATH DE number 6650496 |
Statements
Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics (English)
0 references
10 November 2016
0 references
job shop scheduling
0 references
dual resource constrained systems
0 references
maximum lateness
0 references
worker allocation
0 references
0 references
