A minimum-cost network flow approach to preemptive parallel-machine scheduling

Ling Huey Su; Edwin Tai Chiu Cheng; Fuh Der Chou

doi:10.1016/j.cie.2012.04.020

A minimum-cost network flow approach to preemptive parallel-machine scheduling

Ling Huey Su, Edwin Tai Chiu Cheng, Fuh Der Chou

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

7 Citations (Scopus)

Abstract

We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.

Original language	English
Pages (from-to)	453-458
Number of pages	6
Journal	Computers and Industrial Engineering
Volume	64
Issue number	1
DOIs	https://doi.org/10.1016/j.cie.2012.04.020
Publication status	Published - 1 Jan 2013

Keywords

Minimum-cost network flow
Parallel machines
Preemptive jobs
Scheduling
Uniform machines

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1016/j.cie.2012.04.020

Cite this

@article{3307710e890b47408068dc8970f0d9e6,

title = "A minimum-cost network flow approach to preemptive parallel-machine scheduling",

abstract = "We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.",

keywords = "Minimum-cost network flow, Parallel machines, Preemptive jobs, Scheduling, Uniform machines",

author = "Su, {Ling Huey} and Cheng, {Edwin Tai Chiu} and Chou, {Fuh Der}",

year = "2013",

month = jan,

day = "1",

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

language = "English",

volume = "64",

pages = "453--458",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

number = "1",

}

TY - JOUR

T1 - A minimum-cost network flow approach to preemptive parallel-machine scheduling

AU - Su, Ling Huey

AU - Cheng, Edwin Tai Chiu

AU - Chou, Fuh Der

PY - 2013/1/1

Y1 - 2013/1/1

N2 - We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.

AB - We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.

KW - Minimum-cost network flow

KW - Parallel machines

KW - Preemptive jobs

KW - Scheduling

KW - Uniform machines

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

U2 - 10.1016/j.cie.2012.04.020

DO - 10.1016/j.cie.2012.04.020

M3 - Journal article

SN - 0360-8352

VL - 64

SP - 453

EP - 458

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 1

ER -

A minimum-cost network flow approach to preemptive parallel-machine scheduling

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this