Reverse auction-based job assignment among foundry fabs

DOI10.1080/00207540600792176zbMath1128.90547OpenAlexW2122017263MaRDI QIDQ5438631

Ming-Ming Hsieh, Chia-Wei Chen, Shi Chung Chang

Publication date: 24 January 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/132864/1/09.pdf

zbMATH Keywords

modellingschedulingassignmentLagrange relaxationreverse auctionfoundry manufacturing

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

Ex anteandEx postSubcontracting between Two Competing Bidders

Cites Work

• Surrogate gradient algorithm for Lagrangian relaxation
• Combinatorial Auctions: A Survey
• Solving the machine-loading problem in a flexible manufacturing system using a combinatorial auction-based approach
• A Theory of Auctions and Competitive Bidding
• Steel-making process scheduling using Lagrangian relaxation
• Auction-based distributed scheduling in a dynamic job shop environment

This page was built for publication: Reverse auction-based job assignment among foundry fabs