Scheduling unit-length jobs with machine eligibility restrictions

Chung Lun Li

doi:10.1016/j.ejor.2005.03.023

Scheduling unit-length jobs with machine eligibility restrictions

Chung Lun Li

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

30 Citations (Scopus)

Abstract

We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.

Original language	English
Pages (from-to)	1325-1328
Number of pages	4
Journal	European Journal of Operational Research
Volume	174
Issue number	2
DOIs	https://doi.org/10.1016/j.ejor.2005.03.023
Publication status	Published - 16 Oct 2006

Keywords

Machine eligibility restrictions
Scheduling
Uniform machines
Unit-length jobs

ASJC Scopus subject areas

Information Systems and Management
Management Science and Operations Research
Statistics, Probability and Uncertainty
Applied Mathematics
Modelling and Simulation
Transportation

More information

10.1016/j.ejor.2005.03.023

http://hdl.handle.net/10397/1838

Cite this

@article{4a1b4e9693cf4a0f96919633670a45bd,

title = "Scheduling unit-length jobs with machine eligibility restrictions",

abstract = "We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.",

keywords = "Machine eligibility restrictions, Scheduling, Uniform machines, Unit-length jobs",

author = "Li, \{Chung Lun\}",

year = "2006",

month = oct,

day = "16",

doi = "10.1016/j.ejor.2005.03.023",

language = "English",

volume = "174",

pages = "1325--1328",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Scheduling unit-length jobs with machine eligibility restrictions

AU - Li, Chung Lun

PY - 2006/10/16

Y1 - 2006/10/16

N2 - We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.

AB - We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.

KW - Machine eligibility restrictions

KW - Scheduling

KW - Uniform machines

KW - Unit-length jobs

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

U2 - 10.1016/j.ejor.2005.03.023

DO - 10.1016/j.ejor.2005.03.023

M3 - Journal article

SN - 0377-2217

VL - 174

SP - 1325

EP - 1328

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

Scheduling unit-length jobs with machine eligibility restrictions

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this