Scheduling two-component products on parallel machines

W.-H.Wen-Hua Yang

Omega, 2004, vol. 32, issue 5, 353-359

Abstract: We consider a scheduling problem in which N products are processed on M identical parallel machines. Each product comprises two components. Because the components of a product are processed in a fixed order, one is conveniently called as first-component and the other is as second-component. First-components are fabricated in batches, each of which is initiated with a set-up. As for second-components, they are manufactured individually. Two components of a product are restrictedly processed on the same machine. A product is completed when both its two components have been completed and are available. We propose two heuristics to build up near-optimal schedules with respect to minimizing the total completion time of products. The performances of both heuristics are compared with a lower bound. Especially, within the experimental range, one heuristic not only dominates over the other all the time but also is much more timesaving.

Keywords: Two-component; product; Scheduling; Setup (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305-0483(04)00008-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:32:y:2004:i:5:p:353-359

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().