Scheduling on identical machines with batch arrivals

Tsui-Ping Chung, Ching-Jong Liao and Ling-Huey Su

International Journal of Production Economics, 2010, vol. 123, issue 1, 179-186

Abstract: In the scheduling literature, it is often assumed that jobs arrive either simultaneously or individually. However, this assumption is invalid in most practical situations because jobs usually arrive in batches, e.g., the final testing house in the manufacturing of semiconductor. The concept of batch arrivals has been mentioned in some studies, but it has not been explored from an operational viewpoint. This paper first addresses an identical parallel machine problem with batch arrivals to minimize the total completion time. Since the problem is NP-hard, a heuristic based on binary integer program is proposed. Computational results show that the proposed heuristic can efficiently obtain good solutions for medium and large size problems with an average percentage error of 2.12 from the lower bound.

Keywords: Batch; arrivals; Identical; parallel; machines; Semiconductor; scheduling; Branch; and; bound; algorithm; Total; completion; time (search for similar items in EconPapers)
Date: 2010
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/S0925-5273(09)00278-3
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:proeco:v:123:y:2010:i:1:p:179-186

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().