Scheduling problems in transportation networks of line topology

Dariusz R. Kowalski, Eyal Nussbaum, Michael Segal, Vitaly Milyeykovsky

Research output: Contribution to journalArticle

Abstract

In this paper we consider online scheduling problems for linear topology under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times. We give optimal solutions for uni-directional version of the problem for each of the objectives and show that for the two-directional versions of each problem, no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions. We also propose 2-approximation on-line algorithms for the MinMakespan and the MinSum minimization objectives. We also prove that no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions for the weighted case of uni-directional scenarios.

Original languageEnglish (US)
Pages (from-to)777-799
Number of pages23
JournalOptimization Letters
Volume8
Issue number2
DOIs
StatePublished - Feb 1 2014
Externally publishedYes

Fingerprint

Transportation Networks
Scheduling Problem
Objective function
Optimal Solution
Online Algorithms
Completion Time
Topology
Line
Online Scheduling
Approximation Algorithms
Scenarios

Keywords

  • Linear network
  • Online algorithms
  • Scheduling

ASJC Scopus subject areas

  • Control and Optimization

Cite this

Kowalski, D. R., Nussbaum, E., Segal, M., & Milyeykovsky, V. (2014). Scheduling problems in transportation networks of line topology. Optimization Letters, 8(2), 777-799. https://doi.org/10.1007/s11590-013-0613-x

Scheduling problems in transportation networks of line topology. / Kowalski, Dariusz R.; Nussbaum, Eyal; Segal, Michael; Milyeykovsky, Vitaly.

In: Optimization Letters, Vol. 8, No. 2, 01.02.2014, p. 777-799.

Research output: Contribution to journalArticle

Kowalski, DR, Nussbaum, E, Segal, M & Milyeykovsky, V 2014, 'Scheduling problems in transportation networks of line topology', Optimization Letters, vol. 8, no. 2, pp. 777-799. https://doi.org/10.1007/s11590-013-0613-x
Kowalski, Dariusz R. ; Nussbaum, Eyal ; Segal, Michael ; Milyeykovsky, Vitaly. / Scheduling problems in transportation networks of line topology. In: Optimization Letters. 2014 ; Vol. 8, No. 2. pp. 777-799.
@article{fb3c9363da764dc3924f4a3ec37d3274,
title = "Scheduling problems in transportation networks of line topology",
abstract = "In this paper we consider online scheduling problems for linear topology under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times. We give optimal solutions for uni-directional version of the problem for each of the objectives and show that for the two-directional versions of each problem, no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions. We also propose 2-approximation on-line algorithms for the MinMakespan and the MinSum minimization objectives. We also prove that no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions for the weighted case of uni-directional scenarios.",
keywords = "Linear network, Online algorithms, Scheduling",
author = "Kowalski, {Dariusz R.} and Eyal Nussbaum and Michael Segal and Vitaly Milyeykovsky",
year = "2014",
month = "2",
day = "1",
doi = "10.1007/s11590-013-0613-x",
language = "English (US)",
volume = "8",
pages = "777--799",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer Verlag",
number = "2",

}

TY - JOUR

T1 - Scheduling problems in transportation networks of line topology

AU - Kowalski, Dariusz R.

AU - Nussbaum, Eyal

AU - Segal, Michael

AU - Milyeykovsky, Vitaly

PY - 2014/2/1

Y1 - 2014/2/1

N2 - In this paper we consider online scheduling problems for linear topology under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times. We give optimal solutions for uni-directional version of the problem for each of the objectives and show that for the two-directional versions of each problem, no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions. We also propose 2-approximation on-line algorithms for the MinMakespan and the MinSum minimization objectives. We also prove that no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions for the weighted case of uni-directional scenarios.

AB - In this paper we consider online scheduling problems for linear topology under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times. We give optimal solutions for uni-directional version of the problem for each of the objectives and show that for the two-directional versions of each problem, no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions. We also propose 2-approximation on-line algorithms for the MinMakespan and the MinSum minimization objectives. We also prove that no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions for the weighted case of uni-directional scenarios.

KW - Linear network

KW - Online algorithms

KW - Scheduling

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

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

U2 - 10.1007/s11590-013-0613-x

DO - 10.1007/s11590-013-0613-x

M3 - Article

AN - SCOPUS:84893765446

VL - 8

SP - 777

EP - 799

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 2

ER -