An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
type: Item
instance of: scholarly article
title: An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
zbMATH Open document ID: 1254.90076
author: Dvir Shabtay
author: Shlomo Karhi
published in: Discrete Optimization
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6118999
zbMATH Keywords: multipurpose machine scheduling
zbMATH Keywords: online scheduling
zbMATH Keywords: total completion time
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: j.disopt.2012.07.005
OpenAlex ID: W2049627958
cites work: The Competitiveness of On-Line Assignments
cites work: A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service
cites work: Online and semi-online scheduling of two machines under a grade of service provision
cites work: Online scheduling on parallel machines with two goS levels
cites work: Improved bounds for online scheduling with eligibility constraints
cites work: Online scheduling of two job types on a set of multipurpose machines with unit processing times
cites work: Scheduling unit length jobs on parallel machines with lookahead information
cites work: Online parallel machines scheduling with two hierarchies
DOI: 10.1016/J.DISOPT.2012.07.005
description: scientific article; zbMATH DE number 6118999