You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Taming Tardiness on Parallel Machines: Online Scheduling with Limited Job Information

Fulltext:


Publication Type:

Report - MRTC

Venue:

MRTC Report, Mälardalen Real-Time Research Centre

Publisher:

Mälardalen Real-Time Research Centre, Mälardalen University

ISRN:

MDH-MRTC-352/2024-1-SE


Abstract

We consider the problem of scheduling $n$ jobs on $m geq 2$ parallel machines in online settings with the objective of minimizing total tardiness. Since no bounded competitive algorithms exist to minimize the general problem of weighted total tardiness of the form $sum w_j T_j$, we consider an objective of the form $sum w_j (T_j+d_j)$, where $w_j, T_j$, and $d_j$ are the weight, tardiness, and deadline of each job, respectively and develop competitive algorithms dependent on jobs' processing times.

Bibtex

@techreport{Salman7033,
author = {Shaik Salman and Thomas Nolte and Alessandro Papadopoulos and Saad Mubeen},
title = {Taming Tardiness on Parallel Machines: Online Scheduling with Limited Job Information},
month = {October},
year = {2024},
publisher = {M{\"a}lardalen Real-Time Research Centre, M{\"a}lardalen University},
url = {http://www.es.mdu.se/publications/7033-}
}