On-line scheduling with non-crossing constraints
Loading...
Download
Associated Records
Authors
File Licence
Editors
Date
2008-09-01
Source Title
Operations Research Letters
Journal Title
Journal ISSN
Volume Title
Publisher
ELSEVIER
Melbourne Authors
Affiliation
Mechanical Engineering
Document Type
Journal Article
Subject Code
Citation
Zhang, L., Khammuang, K. & Wirth, A. (2008). On-line scheduling with non-crossing constraints. Operations Research Letters, 36 (5), pp.579-583. https://doi.org/10.1016/j.orl.2008.04.005.
Access Status
This item is currently not available from this repository
Access URL
Open Access URL
Open Access at PMC
Linked Resource URL
NHMRC Grant Code
ARC Grant Code
Description
Abstract
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristics for the on-line list and on-line time problems with unit processing times, and a 3-competitive heuristic for the general on-line time problem.
Notes
Terms of Use
Keywords
Business and Management