Restarts can help in the on-line minimization of the maximum delivery time on a single machine
type: Item
instance of: scholarly article
title: Restarts can help in the on-line minimization of the maximum delivery time on a single machine
zbMATH Open document ID: 0966.90033
author: Marjan Van Den Akker
author: Nodari Vakhania
author: Han Hoogeveen
published in: Journal of Scheduling
publication date: 2001-08-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1556541
zbMATH Keywords: on-line algorithm
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: restart
zbMATH Keywords: worst-case analysis
MaRDI profile type: Publication
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: New lower and upper bounds for on-line scheduling
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
cites work: Q4368485
cites work: Nonclairvoyant scheduling
cites work: Scheduling Parallel Machines On-Line
cites work: Algorithms for Scheduling Tasks on Unrelated Processors
DOI: 10.1002/1099-1425(200011/12)3:6%3C333::AID-JOS53%3E3.0.CO;2-8
description: scientific article; zbMATH DE number 1556541