Scheduling of unrelated parallel machines: An application to PWB manufacturing

Llan Yu, Heloisa M. Shih, Michele Pfund, W. Matthew Carlyle, John Fowler

Research output: Contribution to journalArticle

Abstract

In this paper, we tackle scheduling the bottleneck operation of a Printed Wiring Board (PWB) manufacturing line. The problem may be characterized as unrelated parallel machines and we are interested in several performance measures including: makespan, the average finish time, mean flow time, utilization, the number of lots and the total amount of overtime beyond the release interval. Due to setup reduction techniques employed by the company, setups are negligible, and we construct an Integer Programming (IP) model with a special structure - >unimodularity. Thus, the corresponding linear programming optimal solution always satisfies the integrality constraints. In order to account for multiple objectives of the scheduling system, we introduce preference constraints and bring them into the objective function by Lagrangian Relaxation (LR). We give a heuristic procedure to select constraints to be relaxed, and formulations to determine the Lagrange multipliers. To verify the validity of the proposed method, we compare it with a network model and with a modified FIFO method. The proposed method presents very promising results in terms of our measures of interest.

Original languageEnglish (US)
Pages (from-to)921-931
Number of pages11
JournalIIE Transactions (Institute of Industrial Engineers)
Volume34
Issue number11
DOIs
StatePublished - 2002

Fingerprint

Printed circuit boards
Scheduling
Lagrange multipliers
Integer programming
Linear programming
Industry

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Scheduling of unrelated parallel machines : An application to PWB manufacturing. / Yu, Llan; Shih, Heloisa M.; Pfund, Michele; Carlyle, W. Matthew; Fowler, John.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 34, No. 11, 2002, p. 921-931.

Research output: Contribution to journalArticle

Yu, Llan ; Shih, Heloisa M. ; Pfund, Michele ; Carlyle, W. Matthew ; Fowler, John. / Scheduling of unrelated parallel machines : An application to PWB manufacturing. In: IIE Transactions (Institute of Industrial Engineers). 2002 ; Vol. 34, No. 11. pp. 921-931.
@article{104ab60e5d7740909aa309e47ae10832,
title = "Scheduling of unrelated parallel machines: An application to PWB manufacturing",
abstract = "In this paper, we tackle scheduling the bottleneck operation of a Printed Wiring Board (PWB) manufacturing line. The problem may be characterized as unrelated parallel machines and we are interested in several performance measures including: makespan, the average finish time, mean flow time, utilization, the number of lots and the total amount of overtime beyond the release interval. Due to setup reduction techniques employed by the company, setups are negligible, and we construct an Integer Programming (IP) model with a special structure - >unimodularity. Thus, the corresponding linear programming optimal solution always satisfies the integrality constraints. In order to account for multiple objectives of the scheduling system, we introduce preference constraints and bring them into the objective function by Lagrangian Relaxation (LR). We give a heuristic procedure to select constraints to be relaxed, and formulations to determine the Lagrange multipliers. To verify the validity of the proposed method, we compare it with a network model and with a modified FIFO method. The proposed method presents very promising results in terms of our measures of interest.",
author = "Llan Yu and Shih, {Heloisa M.} and Michele Pfund and Carlyle, {W. Matthew} and John Fowler",
year = "2002",
doi = "10.1080/07408170208928923",
language = "English (US)",
volume = "34",
pages = "921--931",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "11",

}

TY - JOUR

T1 - Scheduling of unrelated parallel machines

T2 - An application to PWB manufacturing

AU - Yu, Llan

AU - Shih, Heloisa M.

AU - Pfund, Michele

AU - Carlyle, W. Matthew

AU - Fowler, John

PY - 2002

Y1 - 2002

N2 - In this paper, we tackle scheduling the bottleneck operation of a Printed Wiring Board (PWB) manufacturing line. The problem may be characterized as unrelated parallel machines and we are interested in several performance measures including: makespan, the average finish time, mean flow time, utilization, the number of lots and the total amount of overtime beyond the release interval. Due to setup reduction techniques employed by the company, setups are negligible, and we construct an Integer Programming (IP) model with a special structure - >unimodularity. Thus, the corresponding linear programming optimal solution always satisfies the integrality constraints. In order to account for multiple objectives of the scheduling system, we introduce preference constraints and bring them into the objective function by Lagrangian Relaxation (LR). We give a heuristic procedure to select constraints to be relaxed, and formulations to determine the Lagrange multipliers. To verify the validity of the proposed method, we compare it with a network model and with a modified FIFO method. The proposed method presents very promising results in terms of our measures of interest.

AB - In this paper, we tackle scheduling the bottleneck operation of a Printed Wiring Board (PWB) manufacturing line. The problem may be characterized as unrelated parallel machines and we are interested in several performance measures including: makespan, the average finish time, mean flow time, utilization, the number of lots and the total amount of overtime beyond the release interval. Due to setup reduction techniques employed by the company, setups are negligible, and we construct an Integer Programming (IP) model with a special structure - >unimodularity. Thus, the corresponding linear programming optimal solution always satisfies the integrality constraints. In order to account for multiple objectives of the scheduling system, we introduce preference constraints and bring them into the objective function by Lagrangian Relaxation (LR). We give a heuristic procedure to select constraints to be relaxed, and formulations to determine the Lagrange multipliers. To verify the validity of the proposed method, we compare it with a network model and with a modified FIFO method. The proposed method presents very promising results in terms of our measures of interest.

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

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

U2 - 10.1080/07408170208928923

DO - 10.1080/07408170208928923

M3 - Article

AN - SCOPUS:78651413930

VL - 34

SP - 921

EP - 931

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 11

ER -