Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times

Xiao Yuan Wang; Zhili Zhou; Ping Ji; Ji Bo Wang

doi:10.1016/j.cie.2014.05.003

Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times

Xiao Yuan Wang, Zhili Zhou, Ping Ji, Ji Bo Wang

Research output: Journal article publication › Journal article › Academic research › peer-review

15 Citations (Scopus)

Abstract

In this note, we deal with the parallel-machine scheduling of deteriorating jobs where the actual processing of a job is a simple linear function of the job's starting time. The jobs are available at time zero but the machines may not be available simultaneously at time zero. For the problem to minimize the logarithm of makespan, we present heuristic algorithms and analyze their worst-case error bounds.

Original language	English
Pages (from-to)	88-91
Number of pages	4
Journal	Computers and Industrial Engineering
Volume	74
Issue number	1
DOIs	https://doi.org/10.1016/j.cie.2014.05.003
Publication status	Published - 1 Jan 2014

Keywords

Deteriorating jobs
Machine availability constraint
Parallel machines
Scheduling
Worst-case analysis

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1016/j.cie.2014.05.003

Cite this

@article{e32d5bc8eb7441d5a8c6bbf7ba86574d,

title = "Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times",

abstract = "In this note, we deal with the parallel-machine scheduling of deteriorating jobs where the actual processing of a job is a simple linear function of the job's starting time. The jobs are available at time zero but the machines may not be available simultaneously at time zero. For the problem to minimize the logarithm of makespan, we present heuristic algorithms and analyze their worst-case error bounds.",

keywords = "Deteriorating jobs, Machine availability constraint, Parallel machines, Scheduling, Worst-case analysis",

author = "Wang, {Xiao Yuan} and Zhili Zhou and Ping Ji and Wang, {Ji Bo}",

year = "2014",

month = jan,

day = "1",

doi = "10.1016/j.cie.2014.05.003",

language = "English",

volume = "74",

pages = "88--91",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

number = "1",

}

TY - JOUR

T1 - Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times

AU - Wang, Xiao Yuan

AU - Zhou, Zhili

AU - Ji, Ping

AU - Wang, Ji Bo

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In this note, we deal with the parallel-machine scheduling of deteriorating jobs where the actual processing of a job is a simple linear function of the job's starting time. The jobs are available at time zero but the machines may not be available simultaneously at time zero. For the problem to minimize the logarithm of makespan, we present heuristic algorithms and analyze their worst-case error bounds.

AB - In this note, we deal with the parallel-machine scheduling of deteriorating jobs where the actual processing of a job is a simple linear function of the job's starting time. The jobs are available at time zero but the machines may not be available simultaneously at time zero. For the problem to minimize the logarithm of makespan, we present heuristic algorithms and analyze their worst-case error bounds.

KW - Deteriorating jobs

KW - Machine availability constraint

KW - Parallel machines

KW - Scheduling

KW - Worst-case analysis

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

U2 - 10.1016/j.cie.2014.05.003

DO - 10.1016/j.cie.2014.05.003

M3 - Journal article

SN - 0360-8352

VL - 74

SP - 88

EP - 91

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 1

ER -

Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this