Bicriterion scheduling with equal processing times on a batch processing machine

L. L. Liu; Chi To Ng; Edwin Tai Chiu Cheng

doi:10.1016/j.cor.2007.07.007

Bicriterion scheduling with equal processing times on a batch processing machine

L. L. Liu, Chi To Ng, Edwin Tai Chiu Cheng

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

20 Citations (Scopus)

Abstract

In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.

Original language	English
Pages (from-to)	110-118
Number of pages	9
Journal	Computers and Operations Research
Volume	36
Issue number	1
DOIs	https://doi.org/10.1016/j.cor.2007.07.007
Publication status	Published - 1 Jan 2009

Keywords

Batch processing machine
Bicriterion
Scheduling

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

More information

10.1016/j.cor.2007.07.007

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

Cite this

@article{5b52c7ac661e48bd8db0da228c488104,

title = "Bicriterion scheduling with equal processing times on a batch processing machine",

abstract = "In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.",

keywords = "Batch processing machine, Bicriterion, Scheduling",

author = "Liu, {L. L.} and Ng, {Chi To} and Cheng, {Edwin Tai Chiu}",

year = "2009",

month = jan,

day = "1",

doi = "10.1016/j.cor.2007.07.007",

language = "English",

volume = "36",

pages = "110--118",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "1",

}

TY - JOUR

T1 - Bicriterion scheduling with equal processing times on a batch processing machine

AU - Liu, L. L.

AU - Ng, Chi To

AU - Cheng, Edwin Tai Chiu

PY - 2009/1/1

Y1 - 2009/1/1

N2 - In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.

AB - In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.

KW - Batch processing machine

KW - Bicriterion

KW - Scheduling

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

U2 - 10.1016/j.cor.2007.07.007

DO - 10.1016/j.cor.2007.07.007

M3 - Journal article

SN - 0305-0548

VL - 36

SP - 110

EP - 118

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 1

ER -

Bicriterion scheduling with equal processing times on a batch processing machine

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this