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

DOI10.1007/S10951-021-00698-3zbMATH Open1479.90095OpenAlexW3194384871MaRDI QIDQ2059092FDOQ2059092

Authors: A. Jabbari, Philip 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

Recommendations

• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• scientific article; zbMATH DE number 2119710
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Scheduling to minimize weighted earliness and tardiness about a common due-date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

zbMATH Keywords

competitive analysissingle machinecompetitive 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)

Cites Work

• Title not available (Why is that?)
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
• Title not available (Why is that?)
• Online scheduling to minimize modified total tardiness with an availability constraint

Cited In (3)

• Title not available (Why is that?)
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• Online scheduling to minimize modified total tardiness with an availability constraint

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059092)