Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers

Xiuli Wang and T.C.E. Cheng

International Journal of Production Economics, 2009, vol. 119, issue 1, 199-206

Abstract: We consider the identical parallel-machine scheduling problem in which both job class setups for job processing and product delivery are required. A setup time is incurred for a job if it is the first job to be processed on a machine or its processing on a machine follows a job that belongs to another class. Processed jobs are delivered in batches to their respective customers. The batch size is limited by the capacity of the delivery vehicles and each shipment incurs a delivery (transportation) cost and takes a fixed amount of time. The objective is to minimize the weighted sum of the last arrival time of the jobs to the customers and the delivery cost. We develop heuristics for the problem and analyse their performance bounds.

Keywords: Machine; scheduling; Job; class; setup; Transportation; Heuristics (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00058-9
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:119:y:2009:i:1:p:199-206

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