A mixed integer linear programming model for dynamic supplier and carrier selection problems
by Purnawan Adi Wicaksono; I. Nyoman Pujawan; Erwin Widodo
International Journal of Procurement Management (IJPM), Vol. 12, No. 3, 2019

Abstract: The dynamic supplier selection problem (DSSP), which occurs when no supplier can fulfil the buyer's total demand due to various limitations, has received attention from academics. However, to the best of our knowledge, there is no publication that addresses the DSSP and carrier selection simultaneously. Given that products are sourced from different suppliers, the choice of carrier is important in order to satisfy demand at the minimum total cost. In this paper, we present a model that integrates the DSSP and carrier selection under uncertain delivery performance; that is, a portion of orders are not delivered on time and a portion of delivered goods are imperfect and hence are rejected by the buyer. We propose a mixed integer linear programming (MILP) model and apply it to a case where a buyer is sourcing multiple items from multiple suppliers and the decision has to be made on a multi-period planning horizon. A numerical example has been tested to show the effectiveness of the model. We assume that backlogging is allowed and the effect of demand fluctuation is analysed.

Online publication date: Thu, 09-May-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Procurement Management (IJPM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com