Integrating production scheduling and transportation procurement through combinatorial auctions

Chefi Triki*, Sujan Piya, Liang Liang Fu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

This study uses the winner determination problem (WDP) to integrate auction transportation procurement with decisions related to production scheduling. The basic problem arises when a manufacturer has to clear a combinatorial auction to decide whether to cover transportation needs by using the in-house fleet or to procure transportation through auction. Thus, the manufacturer should include an additional decision level by integrating the WDP with production scheduling to gain efficiency and achieve savings in the logistics system. To the best of our knowledge, this is the first time production and transportation procurement problems are being solved simultaneously in an integrated manner. The study proposes a mathematical formulation and develops two heuristic approaches for solving the integrated problem. Extensive computational experiments and sensitivity analyses are reported to validate the model, assess the performance of the heuristics, and show the effect of integration on total cost.

Original languageEnglish
Pages (from-to)147-163
Number of pages17
JournalNetworks
Volume76
Issue number2
DOIs
Publication statusPublished - Sep 1 2020
Externally publishedYes

Keywords

  • combinatorial auctions
  • integrated problem
  • production scheduling
  • transportation procurement
  • winner determination problem

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this