Coordinated scheduling on parallel machines with batch delivery

Long Wan and An Zhang

International Journal of Production Economics, 2014, vol. 150, issue C, 199-203

Abstract: This paper considers coordinated scheduling on parallel identical machines with batch delivery. Jobs are first processed on m parallel and identical machines in the manufacturing facility and then delivered to the customer in batches. There are v identical transporters that can carry up to c jobs in one shipment. The objective is to minimize the sum of job arrival times. We show that the problem is NP-hard in the strong sense if m is part of the input. Besides, we propose the first approximation algorithm for the problem and prove that the worst case ratio of the algorithm is 2−1/m for any m.

Keywords: Scheduling; Batching and delivery; Complexity; Worst-case analysis (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527314000115
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:150:y:2014:i:c:p:199-203

DOI: 10.1016/j.ijpe.2014.01.009

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 ().