On-line scheduling of jobs with fixed start and end times
type: Item
instance of: scholarly article
title: On-line scheduling of jobs with fixed start and end times
zbMATH Open document ID: 0810.68068
DOI: 10.1016/0304-3975(94)90150-3
author: Gerhard J. Woeginger
published in: Theoretical Computer Science
publication date: 1994-08-29T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 626305
zbMATH Keywords: on-line scheduling problem
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90150-3
OpenAlex ID: W1980135493
cites work: Scheduling jobs with fixed start and end times
cites work: Q3796804
cites work: A Greedy On-Line Algorithm for thek-Track Assignment Problem
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: An Effective Version of Dilworth's Theorem
cites work: An on-line graph coloring algorithm with sublinear performance ratio
Recommended article: Online Scheduling of Jobs with Fixed Start Times on Related Machines
Recommended article: Online scheduling of jobs with fixed start times on related machines
Recommended article: On-line scheduling for jobs with arbitrary release times
Recommended article: Scheduling jobs with fixed start and end times
Recommended article: On-line scheduling of parallel jobs
Recommended article: Structural Information and Communication Complexity
Recommended article: On-line scheduling of parallel jobs with runtime restrictions
Recommended article: Online scheduling of jobs with kind release times and deadlines on a single machine
Recommended article: Q4779165
Recommended article: On an on-line scheduling problem for parallel jobs
description: scientific article; zbMATH DE number 626305