A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

Chung Lun Li

doi:10.1016/0305-0548(94)00027-6

A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

Chung Lun Li

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

9 Citations (Scopus)

Abstract

Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic.

Original language	English
Pages (from-to)	277-283
Number of pages	7
Journal	Computers and Operations Research
Volume	22
Issue number	3
DOIs	https://doi.org/10.1016/0305-0548(94)00027-6
Publication status	Published - 1 Jan 1995
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
Management Science and Operations Research
Modelling and Simulation
Information Systems and Management
Applied Mathematics
Transportation

More information

10.1016/0305-0548(94)00027-6

Cite this

@article{ad28056cac2e419ba8ea43b674425dfb,

title = "A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs",

abstract = "Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic.",

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

year = "1995",

month = jan,

day = "1",

doi = "10.1016/0305-0548(94)00027-6",

language = "English",

volume = "22",

pages = "277--283",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

AU - Li, Chung Lun

PY - 1995/1/1

Y1 - 1995/1/1

N2 - Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic.

AB - Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic.

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

U2 - 10.1016/0305-0548(94)00027-6

DO - 10.1016/0305-0548(94)00027-6

M3 - Journal article

SN - 0305-0548

VL - 22

SP - 277

EP - 283

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3

ER -

A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this