A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

Hochang Lee; Monique Guignard

doi:10.1057/jors.1996.152

A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

Hochang Lee
, Monique Guignard

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

Abstract

A nonpreemptive single stage manufacturing process with parallel, unrelated machines and multiple job types with setups (PUMS) is considered. We propose a hybrid approximation procedure where a Lag- rangean relaxation dual and a Lagrangean decomposition dual are solved one after the other to generate a good lower bound on the optimal makespan value. Computational results are reported.

Original language	English
Pages (from-to)	1247-1261
Number of pages	15
Journal	Journal of the Operational Research Society
Volume	47
Issue number	10
DOIs	https://doi.org/10.1057/jors.1996.152
Publication status	Published - Oct 1996

Keywords

Lagrangean decomposition
Lagrangean relaxation
Scheduling

Access to Document

10.1057/jors.1996.152

Cite this

@article{4bee3c714f9d446fba512f5b015804ba,

title = "A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups",

abstract = "A nonpreemptive single stage manufacturing process with parallel, unrelated machines and multiple job types with setups (PUMS) is considered. We propose a hybrid approximation procedure where a Lag- rangean relaxation dual and a Lagrangean decomposition dual are solved one after the other to generate a good lower bound on the optimal makespan value. Computational results are reported.",

keywords = "Lagrangean decomposition, Lagrangean relaxation, Scheduling",

author = "Hochang Lee and Monique Guignard",

year = "1996",

month = oct,

doi = "10.1057/jors.1996.152",

language = "English",

volume = "47",

pages = "1247--1261",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "10",

}

TY - JOUR

T1 - A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

AU - Lee, Hochang

AU - Guignard, Monique

PY - 1996/10

Y1 - 1996/10

N2 - A nonpreemptive single stage manufacturing process with parallel, unrelated machines and multiple job types with setups (PUMS) is considered. We propose a hybrid approximation procedure where a Lag- rangean relaxation dual and a Lagrangean decomposition dual are solved one after the other to generate a good lower bound on the optimal makespan value. Computational results are reported.

AB - A nonpreemptive single stage manufacturing process with parallel, unrelated machines and multiple job types with setups (PUMS) is considered. We propose a hybrid approximation procedure where a Lag- rangean relaxation dual and a Lagrangean decomposition dual are solved one after the other to generate a good lower bound on the optimal makespan value. Computational results are reported.

KW - Lagrangean decomposition

KW - Lagrangean relaxation

KW - Scheduling

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

U2 - 10.1057/jors.1996.152

DO - 10.1057/jors.1996.152

M3 - Article

AN - SCOPUS:0030269395

SN - 0160-5682

VL - 47

SP - 1247

EP - 1261

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 10

ER -

A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this