Single machine scheduling with total tardiness criterion and convex controllable processing times

Kailiang Xu; Zuren Feng; Liangjun Ke

doi:10.1007/s10479-010-0827-6

Single machine scheduling with total tardiness criterion and convex controllable processing times

Kailiang Xu
, Zuren Feng
, Liangjun Ke

Faculty of Electronic and Information Engineering

Xi'an Jiaotong University

Research output: Contribution to journal › Review article › peer-review

15 Scopus citations

Abstract

We consider a single machine scheduling problem with total tardiness criteria and controllable job-processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n²) is presented for the special case where jobs have a common due date.

Original language	English
Pages (from-to)	383-391
Number of pages	9
Journal	Annals of Operations Research
Volume	186
Issue number	1
DOIs	https://doi.org/10.1007/s10479-010-0827-6
State	Published - Jun 2011

Keywords

Convex resource consumption function
Single machine
Total tardiness criteria

Access to Document

10.1007/s10479-010-0827-6

Cite this

@article{47f436634f2b420fa743fd97a2498bdd,

title = "Single machine scheduling with total tardiness criterion and convex controllable processing times",

abstract = "We consider a single machine scheduling problem with total tardiness criteria and controllable job-processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n2) is presented for the special case where jobs have a common due date.",

keywords = "Convex resource consumption function, Single machine, Total tardiness criteria",

author = "Kailiang Xu and Zuren Feng and Liangjun Ke",

year = "2011",

month = jun,

doi = "10.1007/s10479-010-0827-6",

language = "英语",

volume = "186",

pages = "383--391",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Single machine scheduling with total tardiness criterion and convex controllable processing times

AU - Xu, Kailiang

AU - Feng, Zuren

AU - Ke, Liangjun

PY - 2011/6

Y1 - 2011/6

N2 - We consider a single machine scheduling problem with total tardiness criteria and controllable job-processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n2) is presented for the special case where jobs have a common due date.

AB - We consider a single machine scheduling problem with total tardiness criteria and controllable job-processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n2) is presented for the special case where jobs have a common due date.

KW - Convex resource consumption function

KW - Single machine

KW - Total tardiness criteria

UR - https://www.scopus.com/pages/publications/79958787559

U2 - 10.1007/s10479-010-0827-6

DO - 10.1007/s10479-010-0827-6

M3 - 文献综述

AN - SCOPUS:79958787559

SN - 0254-5330

VL - 186

SP - 383

EP - 391

JO - Annals of Operations Research

JF - Annals of Operations Research

IS - 1

ER -

Single machine scheduling with total tardiness criterion and convex controllable processing times

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this