Online scheduling to minimize total weighted (modified) earliness and tardiness cost

DOI10.1007/S10951-021-00698-3zbMath1479.90095OpenAlexW3194384871MaRDI QIDQ2059092

Arman Jabbari, Philip M. Kaminsky

Publication date: 13 December 2021

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-021-00698-3

zbMATH Keywords

single machinecompetitive analysiscompetitive ratioonline algorithmonline schedulingearliness and 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 (1)

Online scheduling of two-machine flowshop with lookahead and incompatible job families

Cites Work

• Unnamed Item
• Unnamed Item
• Online scheduling to minimize modified total tardiness with an availability constraint
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

This page was built for publication: Online scheduling to minimize total weighted (modified) earliness and tardiness cost