Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4223058 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Current trends in deterministic scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Makespan minimization for two parallel machines with an availability constraint / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Machine scheduling with an availability constraint / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal online algorithm for scheduling on two identical machines with machine availability constraints. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Makespan minimization for two parallel machines scheduling with a periodic availability constraint / rank | |||
Normal rank |
Revision as of 11:47, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint |
scientific article |
Statements
Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (English)
0 references
10 October 2011
0 references
online scheduling
0 references
makespan
0 references
competitive analysis
0 references
parallel machines
0 references
periodic availability constraint
0 references
0 references