Parameterized Multi-Scenario Single-Machine Scheduling Problems

Danny Hermelin; George Manoussakis; Michael Pinedo; Dvir Shabtay; Liron Yedidsion

doi:https://doi.org/10.1007/s00453-020-00702-w

Parameterized Multi-Scenario Single-Machine Scheduling Problems

Danny Hermelin, George Manoussakis, Michael Pinedo, Dvir Shabtay, Liron Yedidsion

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

We study a class of multi-scenario single-machine scheduling problems. In this class of problems, we are given a set of scenarios with each one having a different realization of job characteristics. We consider these multi-scenario problems where the scheduling criterion can be any one of the following three: The total weighted completion time, the weighted number of tardy jobs, and the weighted number of jobs completed exactly at their due-date. As all the resulting problems are NP-hard, our analysis focuses on whether any one of the problems becomes tractable when some specific natural parameters are of limited size. The analysis includes the following parameters: The number of jobs with scenario-dependent processing times, the number of jobs with scenario-dependent weights, and the number of different due-dates.

Original language	American English
Pages (from-to)	2644-2667
Number of pages	24
Journal	Algorithmica
Volume	82
Issue number	9
DOIs	https://doi.org/10.1007/s00453-020-00702-w
State	Published - 1 Sep 2020

Keywords

Fixed-parameter tractability
Multi-scenario scheduling
Parameterized complexity
Robust job schedule
Single machine scheduling

All Science Journal Classification (ASJC) codes

General Computer Science
Applied Mathematics
Computer Science Applications

Access to Document

https://doi.org/10.1007/s00453-020-00702-w

Cite this

@article{359677a5dd854763a18b973aeb12b0f7,

title = "Parameterized Multi-Scenario Single-Machine Scheduling Problems",

abstract = "We study a class of multi-scenario single-machine scheduling problems. In this class of problems, we are given a set of scenarios with each one having a different realization of job characteristics. We consider these multi-scenario problems where the scheduling criterion can be any one of the following three: The total weighted completion time, the weighted number of tardy jobs, and the weighted number of jobs completed exactly at their due-date. As all the resulting problems are NP-hard, our analysis focuses on whether any one of the problems becomes tractable when some specific natural parameters are of limited size. The analysis includes the following parameters: The number of jobs with scenario-dependent processing times, the number of jobs with scenario-dependent weights, and the number of different due-dates.",

keywords = "Fixed-parameter tractability, Multi-scenario scheduling, Parameterized complexity, Robust job schedule, Single machine scheduling",

author = "Danny Hermelin and George Manoussakis and Michael Pinedo and Dvir Shabtay and Liron Yedidsion",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2020",

month = sep,

day = "1",

doi = "https://doi.org/10.1007/s00453-020-00702-w",

language = "American English",

volume = "82",

pages = "2644--2667",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "9",

}

TY - JOUR

T1 - Parameterized Multi-Scenario Single-Machine Scheduling Problems

AU - Hermelin, Danny

AU - Manoussakis, George

AU - Pinedo, Michael

AU - Shabtay, Dvir

AU - Yedidsion, Liron

PY - 2020/9/1

Y1 - 2020/9/1

N2 - We study a class of multi-scenario single-machine scheduling problems. In this class of problems, we are given a set of scenarios with each one having a different realization of job characteristics. We consider these multi-scenario problems where the scheduling criterion can be any one of the following three: The total weighted completion time, the weighted number of tardy jobs, and the weighted number of jobs completed exactly at their due-date. As all the resulting problems are NP-hard, our analysis focuses on whether any one of the problems becomes tractable when some specific natural parameters are of limited size. The analysis includes the following parameters: The number of jobs with scenario-dependent processing times, the number of jobs with scenario-dependent weights, and the number of different due-dates.

AB - We study a class of multi-scenario single-machine scheduling problems. In this class of problems, we are given a set of scenarios with each one having a different realization of job characteristics. We consider these multi-scenario problems where the scheduling criterion can be any one of the following three: The total weighted completion time, the weighted number of tardy jobs, and the weighted number of jobs completed exactly at their due-date. As all the resulting problems are NP-hard, our analysis focuses on whether any one of the problems becomes tractable when some specific natural parameters are of limited size. The analysis includes the following parameters: The number of jobs with scenario-dependent processing times, the number of jobs with scenario-dependent weights, and the number of different due-dates.

KW - Fixed-parameter tractability

KW - Multi-scenario scheduling

KW - Parameterized complexity

KW - Robust job schedule

KW - Single machine scheduling

UR - http://www.scopus.com/inward/record.url?scp=85082948111&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s00453-020-00702-w

DO - https://doi.org/10.1007/s00453-020-00702-w

M3 - Article

SN - 0178-4617

VL - 82

SP - 2644

EP - 2667

JO - Algorithmica

JF - Algorithmica

IS - 9

ER -

Parameterized Multi-Scenario Single-Machine Scheduling Problems

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this