Scheduling with machine cost and rejection

G. Dósa, Yong He

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

In this paper we consider the scheduling problem with machine cost and rejection penalties. For this problem we are given a sequence of independent jobs each being characterized by its processing time (size) and its penalty. No machine is initially provided and when a job is revealed the algorithm has the option to purchase new machines. Right when a new job arrives we have the following choices: (i) reject it in which case we pay its penalty; (ii) non-preemptively process it on an existing machine which contributes to the machine load; (iii) purchase a new machine and assign it to this machine. The objective is to minimize the sum of the makespan the cost for purchasing machines and the total penalty of all rejected jobs. For the small job case (where all jobs have sizes no greater than the cost for purchasing one machine and which is the generalization of the Ski-Rental Problem) we present an optimal online algorithm with a competitive ratio of 2.

Original languageEnglish
Pages (from-to)337-350
Number of pages14
JournalJournal of Combinatorial Optimization
Volume12
Issue number4
DOIs
Publication statusPublished - Dec 2006

Fingerprint

Rejection
Penalty
Scheduling
Purchasing
Costs
Competitive Ratio
Online Algorithms
Optimal Algorithm
Assign
Scheduling Problem
Processing
Minimise

Keywords

  • Machine cost
  • Online algorithm
  • Rejection penalty
  • Scheduling

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Mathematics(all)
  • Control and Optimization
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Scheduling with machine cost and rejection. / Dósa, G.; He, Yong.

In: Journal of Combinatorial Optimization, Vol. 12, No. 4, 12.2006, p. 337-350.

Research output: Contribution to journalArticle

@article{79437b5d218e43afbeda90a4976913c8,
title = "Scheduling with machine cost and rejection",
abstract = "In this paper we consider the scheduling problem with machine cost and rejection penalties. For this problem we are given a sequence of independent jobs each being characterized by its processing time (size) and its penalty. No machine is initially provided and when a job is revealed the algorithm has the option to purchase new machines. Right when a new job arrives we have the following choices: (i) reject it in which case we pay its penalty; (ii) non-preemptively process it on an existing machine which contributes to the machine load; (iii) purchase a new machine and assign it to this machine. The objective is to minimize the sum of the makespan the cost for purchasing machines and the total penalty of all rejected jobs. For the small job case (where all jobs have sizes no greater than the cost for purchasing one machine and which is the generalization of the Ski-Rental Problem) we present an optimal online algorithm with a competitive ratio of 2.",
keywords = "Machine cost, Online algorithm, Rejection penalty, Scheduling",
author = "G. D{\'o}sa and Yong He",
year = "2006",
month = "12",
doi = "10.1007/s10878-006-9003-y",
language = "English",
volume = "12",
pages = "337--350",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - Scheduling with machine cost and rejection

AU - Dósa, G.

AU - He, Yong

PY - 2006/12

Y1 - 2006/12

N2 - In this paper we consider the scheduling problem with machine cost and rejection penalties. For this problem we are given a sequence of independent jobs each being characterized by its processing time (size) and its penalty. No machine is initially provided and when a job is revealed the algorithm has the option to purchase new machines. Right when a new job arrives we have the following choices: (i) reject it in which case we pay its penalty; (ii) non-preemptively process it on an existing machine which contributes to the machine load; (iii) purchase a new machine and assign it to this machine. The objective is to minimize the sum of the makespan the cost for purchasing machines and the total penalty of all rejected jobs. For the small job case (where all jobs have sizes no greater than the cost for purchasing one machine and which is the generalization of the Ski-Rental Problem) we present an optimal online algorithm with a competitive ratio of 2.

AB - In this paper we consider the scheduling problem with machine cost and rejection penalties. For this problem we are given a sequence of independent jobs each being characterized by its processing time (size) and its penalty. No machine is initially provided and when a job is revealed the algorithm has the option to purchase new machines. Right when a new job arrives we have the following choices: (i) reject it in which case we pay its penalty; (ii) non-preemptively process it on an existing machine which contributes to the machine load; (iii) purchase a new machine and assign it to this machine. The objective is to minimize the sum of the makespan the cost for purchasing machines and the total penalty of all rejected jobs. For the small job case (where all jobs have sizes no greater than the cost for purchasing one machine and which is the generalization of the Ski-Rental Problem) we present an optimal online algorithm with a competitive ratio of 2.

KW - Machine cost

KW - Online algorithm

KW - Rejection penalty

KW - Scheduling

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

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

U2 - 10.1007/s10878-006-9003-y

DO - 10.1007/s10878-006-9003-y

M3 - Article

AN - SCOPUS:33749618169

VL - 12

SP - 337

EP - 350

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 4

ER -