An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
type: Item
instance of: scholarly article
title: An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
zbMATH Open document ID: 1368.90078
author: Jia Xu
author: Zhaohui Liu
published in: Journal of the Operations Research Society of China
publication date: 2017-08-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6759234
zbMATH Keywords: scheduling
zbMATH Keywords: parallel machine
zbMATH Keywords: eligibility constraint
zbMATH Keywords: online algorithm
MaRDI profile type: Publication
full work available at URL: s40305-016-0119-1
OpenAlex ID: W2310430865
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling on identical machines: How good is LPT in an on-line setting?
cites work: An optimal online algorithm for scheduling two machines with release times
cites work: An optimal rounding gives a better approximation for scheduling unrelated machines
cites work: Parallel machine scheduling with nested job assignment restrictions
cites work: Scheduling Parallel Machines On-Line
cites work: Online scheduling with equal processing times and machine eligibility constraints
cites work: Makespan minimization in online scheduling with machine eligibility
DOI: 10.1007/S40305-016-0119-1
description: scientific article; zbMATH DE number 6759234