Scheduling resource allocation with timeslot penalty for changeover

DOI10.1016/J.TCS.2006.09.016zbMath1110.68012OpenAlexW1975802301MaRDI QIDQ861274

Amrinder Arora, Hyeong-Ah Choi, Fanchun Jin

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.016

zbMATH Keywords

resource allocationonline schedulingchangeover costwireless scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (5)

New algorithms for online rectangle filling with \(k\)-lookahead ⋮ An improved algorithm for online rectangle filling ⋮ New Algorithms for Online Rectangle Filling with k-Lookahead ⋮ Online rectangle filling ⋮ Online Rectangle Filling

Cites Work

• New algorithms for an ancient scheduling problem.
• A competitive analysis of the list update problem with lookahead
• Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
• Better Bounds for Online Scheduling
• Optimal online scheduling of parallel jobs with dependencies
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling resource allocation with timeslot penalty for changeover