A semi-on-line scheduling problem of two parallel machines with common maintenance time
type: Item
instance of: scholarly article
zbMATH Open document ID: 1250.90033
DOI: 10.1142/S0217595912500200
author: Yuhua Cai
author: Qi Feng
author: Wenjie Li
published in: Asia-Pacific Journal of Operational Research
publication date: 2012-10-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 6094179
zbMATH Keywords: semi-on-line scheduling
zbMATH Keywords: on-line algorithm
zbMATH Keywords: competitive ratio
zbMATH Keywords: common maintenance time
MaRDI profile type: Publication
cites work: Better Bounds for Online Scheduling
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
cites work: Parallel machines scheduling with machine shutdowns
cites work: The effect of machine availability on the worst-case performance of LPT
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Machine scheduling with an availability constraint
cites work: Improved Bounds for the Online Scheduling Problem
cites work: Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
title: A semi-on-line scheduling problem of two parallel machines with common maintenance time
description: scientific article; zbMATH DE number 6094179