Online scheduling to minimize modified total tardiness with an availability constraint

DOI10.1016/j.tcs.2009.07.055zbMath1180.90129OpenAlexW2087084795WikidataQ57185771 ScholiaQ57185771MaRDI QIDQ1034623

Feifeng Zheng, Ming Liu, Chengbin Chu, Yin-Feng Xu

Publication date: 6 November 2009

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

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

zbMATH Keywords

online schedulingsingle processormodified tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports ⋮ Online scheduling to minimize total weighted (modified) earliness and tardiness cost

Cites Work

• Unnamed Item
• Unnamed Item
• On-line scheduling to minimize average completion time revisited.
• On-line scheduling of parallel machines to minimize total completion times
• Online scheduling of two uniform machines to minimize total completion times
• On-line preemptive scheduling on uniform machines
• A class of on-line scheduling algorithms to minimize total completion time
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
• Competitive online scheduling of perfectly malleable jobs with setup times
• Approximation Techniques for Average Completion Time Scheduling
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Minimizing the total completion time on-line on a single machine, using restarts

This page was built for publication: Online scheduling to minimize modified total tardiness with an availability constraint