An auction mechanism for capacity allocation in identical parallel machines with time window constraints

Qianqian Zhu and Xiuli Wang

European Journal of Industrial Engineering, 2023, vol. 17, issue 6, 833-855

Abstract: We study the scarce production capacity allocation problem in a decentralised decision-making environment. We focus on the design of an auction mechanism for effective allocation of scarce capacity, without private information. In our problem setting, the firm's machine environment is identical parallel machines, and each customer order must be processed within a time window. Here, resource scarcity depends not only on capacity, but also on the customer orders' time window constraints. Hence, we propose an ascending auction with a discriminatory pricing scheme for customers, to identify the real processing requirements of the customer orders and resolve resource conflicts. In our auction, the winner determination problem is NP-complete, we develop a heuristic to solve this problem using the Lagrangian relaxation technique. The computational study shows that our auction mechanism achieves over 93% of the global optimal value. [Submitted 20 April 2021; Accepted 6 May 2022]

Keywords: capacity allocation; auction mechanism; price discrimination; Lagrangian relaxation. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=134700 (text/html)
Access to full text is restricted to subscribers.

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:ids:eujine:v:17:y:2023:i:6:p:833-855

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().