On-line scheduling with extendable working time on a small number of machines

DOI10.1016/S0020-0190(02)00404-0zbMath1173.68420OpenAlexW1964777374MaRDI QIDQ1007518

Deshi Ye, Guo-Chuan Zhang

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00404-0

zbMATH Keywords

analysis of algorithmscompetitive ratioon-line scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Approximation schemes for the generalized extensible bin packing problem ⋮ A web-based ERP system for business services and supply chain management: Application to real-world process scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 13/12 approximation algorithm for bin packing with extendable bins
• Approximation schemes for scheduling on parallel machines
• On-line approximation algorithms for scheduling tasks on identical machines with extendable working time

This page was built for publication: On-line scheduling with extendable working time on a small number of machines