143
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

Reverse auction-based job assignment among foundry fabs

, &
Pages 653-673 | Received 01 Mar 2006, Published online: 22 Feb 2007

References

  • Bertsekas , DP . 1990 . The auction algorithm fo assignment and other network flow problems: a tutorial . Interfaces , 20 : 133 – 149 .
  • Clarke , P . 2004 . Foundry broker sets up shop with 1st Silicon, Tower, ZMD. . EE Times , March Available online at: http://www.eetimes.com/news/latest/showArticle.jhtml ?articleID=18400118
  • Dewan , P and Joshi , S . 2002 . Auction-based distributed scheduling in a dynamic job shop environment . Int. J. Prod. Res. , 40 ( 5 ) : 1173 – 1191 .
  • Fan , M , Stallaert , J and Whinston , AB . 2003 . Decentralized mechanism design for supply chain organizations using an auction market . Inform. Syst. Res. , 14 ( 1 ) : 1 – 22 .
  • Ghawi , D and Schneider , GP . 2004 . New Approaches to Online Procurement . Allied Academies International Conference , 8 ( 2 ) 13–16 October : 25 – 28 . 2004 Proceedings of the Academy of Information and Management Sciences, Maui
  • Hao , S . 2000 . A study of basic bidding strategy in clearing pricing auctions . IEEE Trans. Power Syst. , 15 ( 3 ) : 975 – 980 .
  • Hogan , WE . 2005 . Market design and electricity restructuring . Association of Power Exchanges 2005 Annual Conference , 1 November Orlando FL, Presentation
  • Hoitomt , DJ , Luh , PB and Pattipati , KR . 1993 . A practical approach to job-shop scheduling problems . IEEE Trans. Robot. Autom. , 9 ( 1 ) : 1 – 13 .
  • Hwang , TK and Chang , SC . 2003 . Design of a Lagrangian relaxation-based hierarchical production scheduling environment for semiconductor wafer fabrication . IEEE Trans. Robot. Autom. , 19 ( 4 ) : 566 – 578 .
  • Karabuk , S and Wu , SD . 2002 . Decentralizing semiconductor capacity planning via internal market coordination . IIE Trans. , : 743 – 759 .
  • Karabuk , S and Wu , SD . 2005 . Incentive schemes for semiconductor capacity-allocation: a game theoretic analysis . 14 ( 2 ) : 175 – 188 .
  • Kutanoglu , E and Wu , SD . 1999 . On combinatorial auction and lagrangean relaxation for distributed ressource scheduling . IIE Trans. , 31 : 813 – 826 .
  • Liao , D-Y , Chang , SC , Pei , KW and Chang , CM . 1996 . Daily scheduling for R&D semiconductor fabrication . IEEE Trans. Semiconductor Manuf. , 9 ( 4 ) : 550 – 561 .
  • Luh , PB , Ni , M , Chen , H and Thakur , LS . 2003 . Price-based approach for activity coordination in a supply network . IEEE Trans. Robot. Autom. , 19 ( 2 ) : 335 – 346 .
  • Luh , PB , Blankson , WE , Chen , Y , Yan , JH , Stern , GA , Chang , SC and Zhao , F . 2006 . Payment cost minimization auction for deregulated electricity markets using surrogate optimization . IEEE Trans. Power Syst. , 21 ( 2 ) : 568 – 578 .
  • Milgrom , PR and Weber , RJ . 1982 . A theory of auctions and competitive biddings . Econometrica , 50 ( 5 ) : 1089 – 1122 .
  • Sarne , D , Hadad , M and Kraus , S . “ Auction equilibrium strategies for task allocation in uncertain environments ” . In Cooperative Information Agents VIII, LNAI , Edited by: Ossowski , S and Kashyap , V . 271 – 285 . Springer-Verlag .
  • Srivinas , M , Tiwari , K and Allada , V . 2004 . Solving the machine-loading problem in a flexible manufacturing system using a combinatorial auction-based approach . Int. J. Prod. Res. , 42 ( 9 ) : 1879 – 1893 .
  • Su , Y-H , Guo , RS and Chang , SC . 2005 . Virtual fab: an enabling framework and dynamic manufacturing service provision mechanism . Inform. & Manag. , 42 ( 2 ) : 329 – 348 .
  • Tang , L , Luh , PB , Liu , J and Fang , L . 2002 . Steelmaking process scheduling using Lagrangian relaxation . Int. J. Prod. Res. , 40 ( 1 ) : 55 – 70 .
  • de Vries , S and Vohray , RV . 2003 . Combinatorial auctions: a survey . INFORMS J. Comput. , 15 ( 3 ) : 284 – 309 .
  • Yu , D , Luh , PB and Chang , SC . 2005 . Achieving six sigma deliveries in supply chains . Proceedings of the 16th IFAC World Congress , 4–8 July Prague
  • Zhao , X , Luh , PB and Wang , J . 1999 . The surrogate gradient algorithm for Lagrangian relaxation method . J. Opt. Theory Appl. , 100 ( 3 ) : 699 – 712 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.