Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Xiao-Lin Li / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Yan-Li Huang / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cor.2019.02.012 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2920140993 / rank | |||
Normal rank |
Revision as of 02:29, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families |
scientific article |
Statements
Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (English)
0 references
27 March 2019
0 references
batch processing machine
0 references
heuristics
0 references
maximum lateness
0 references
lower bound
0 references
job families
0 references