Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs

Esaignani Selvarajah and Rui Zhang

International Journal of Production Economics, 2014, vol. 147, issue PA, 117-124

Abstract: In a supply chain, a manufacturer receives jobs from suppliers at distinct time points, and produces and delivers final products to customers in batches. The manufacturer can be modeled as a single machine in the supply chain and the problem can thus be modelled as minimizing the sum of weighted flow time and the batch delivery costs. Since the problem with arbitrary processing times, release times and weights is strongly NP-hard, we first analyze some polynomially solvable special problems. Then we develop a heuristic algorithm to solve the general problem. We also develop a lower bound to study the performance of our heuristic algorithm and the computational experiments show that the solutions of the heuristic algorithm are close to optimal solution.

Keywords: Batching; Scheduling; Release time; Delivery cost; Manufacturer; Supply chain (search for similar items in EconPapers)
Date: 2014
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/S0925527313003708
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:147:y:2014:i:pa:p:117-124

DOI: 10.1016/j.ijpe.2013.08.015

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