Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

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

doi:10.1007/s11590-012-0575-4

Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

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

Abstract

Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.

Original language	English
Pages (from-to)	307-318
Number of pages	12
Journal	Optimization Letters
Volume	8
Issue number	1
DOIs	https://doi.org/10.1007/s11590-012-0575-4
Publication status	Published - 1 Jan 2014

Keywords

Batch processing
Makespan
Release dates
Scheduling

ASJC Scopus subject areas

Control and Optimization

More information

10.1007/s11590-012-0575-4

Cite this

@article{14aae6aafb3242e69e652c40aea48486,

title = "Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan",

abstract = "Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.",

keywords = "Batch processing, Makespan, Release dates, Scheduling",

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

year = "2014",

month = jan,

day = "1",

doi = "10.1007/s11590-012-0575-4",

language = "English",

volume = "8",

pages = "307--318",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

AU - Liu, L. L.

AU - Ng, Chi To

AU - Cheng, Edwin Tai Chiu

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.

AB - Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.

KW - Batch processing

KW - Makespan

KW - Release dates

KW - Scheduling

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

U2 - 10.1007/s11590-012-0575-4

DO - 10.1007/s11590-012-0575-4

M3 - Journal article

SN - 1862-4472

VL - 8

SP - 307

EP - 318

JO - Optimization Letters

JF - Optimization Letters

IS - 1

ER -

Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this