Makespan Minimization in Job Shops: A Linear Time Approximation Scheme (Q4443085): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Klaus Jansen / rank | |||
Property / author | |||
Property / author: Klaus Jansen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/s0895480199363908 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2053608913 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:50, 30 July 2024
scientific article; zbMATH DE number 2024366
Language | Label | Description | Also known as |
---|---|---|---|
English | Makespan Minimization in Job Shops: A Linear Time Approximation Scheme |
scientific article; zbMATH DE number 2024366 |
Statements
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme (English)
0 references
8 January 2004
0 references
approximation algorithm
0 references
approximation scheme
0 references
job shop scheduling
0 references