Online makespan minimization with parallel schedules (Q2362356): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q3188878
aliases / en / 0aliases / en / 0
 
Online Makespan Minimization with Parallel Schedules
description / endescription / en
 
scientific article; zbMATH DE number 6339243
Property / title
 
Online Makespan Minimization with Parallel Schedules (English)
Property / title: Online Makespan Minimization with Parallel Schedules (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1366.68370 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-08404-6_2 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithm Theory – SWAT 2014 / rank
 
Normal rank
Property / publication date
 
2 September 2014
Timestamp+2014-09-02T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 2 September 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6339243 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2505019705 / rank
 
Normal rank

Revision as of 09:56, 6 May 2024

scientific article; zbMATH DE number 6339243
  • Online Makespan Minimization with Parallel Schedules
Language Label Description Also known as
English
Online makespan minimization with parallel schedules
scientific article; zbMATH DE number 6339243
  • Online Makespan Minimization with Parallel Schedules

Statements

Online makespan minimization with parallel schedules (English)
0 references
Online Makespan Minimization with Parallel Schedules (English)
0 references
0 references
0 references
7 July 2017
0 references
2 September 2014
0 references
scheduling
0 references
makespan minimization
0 references
online algorithms
0 references
competitive analysis
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references