An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605): 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.1016/j.orl.2013.01.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979238414 / rank | |||
Normal rank | |||
Revision as of 23:31, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan |
scientific article |
Statements
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (English)
0 references
14 May 2014
0 references
online scheduling
0 references
parallel-batch machine
0 references
incompatible job families
0 references
competitive ratio
0 references
