[1]	P. Keskinocak and S. Tayur, "Due date management policies " in Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, International Series in Operations Research and Management Science, D. Simchi-Levi, S. D. Wu, and Z. M. Shen, Eds. Norwell, MA: Kluwer Academic Publishers, 2004, pp. 485-553.
[2]	J. D. Blackburn, T. Elrod, W. B. Lindsley, and A. J. Zahorik, "The strategic value of response time and product variety," in Manufacturing Strategy - Process and Content, C. A. Voss, Ed. London: Chapman and Hall, 1992.
[3]	K. C. So and J. S. Song, "Price, delivery time guarantees and capacity selection," European Journal of Operational Research, vol. 111, pp. 28-49, 1998.
[4]	K. C. So, "Price and time competition for service delivery," Manufacturing & Service Operations Management, vol. 2, pp. 392-409, 2000.
[5]	J. Magretta, "Fast, global, and entrepreneurial: supply chain management, Hong Kong style-an interview with Victor Fung," Harvard Business Review, vol. 76, pp. 102-115, 1998.
[6]	S. Kwang Mong and W. Eric, "Toward market-driven agents for electronic auction," IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans vol. 31, pp. 474-484, 2001.
[7]	E. Campos-Naez, N. Fabra, and A. Garcia, "Dynamic Auctions for On-Demand Services," IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, vol. 37, pp. 878-886, 2007.
[8]	D. C. Parkes and J. Kalagnanam, "Models for iterative multiattribute procurement auctions," Management Science, vol. 51, pp. 435-451, 2005.
[9]	W. Li, X. Luo, Y. Tu, and D. Xue, " Adaptive production scheduling for one-of-a-kind production with mass customization," Transactions of the North American Manufacturing Research Institution of SME, vol. 35, pp. 41-48, 2007.
[10]	W. Vickrey, "Counterspeculation, auctions, and competitive sealed tenders," Journal of finance, vol. 16, pp. 8-37, 1961.
[11]	R. L. Rardin, Optimization in Operations Research. Upper Saddle River, New Jersey: Prentice Hall Publishers, 1998.
[12]	C. Wang, H. H. Ghenniwa, and W. Shen, "Constraint-based winner determination for auction-based scheduling," IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans vol. 39, pp. 609-618, 2009.
[13]	D. C. Parkes, "iBundle: an efficient ascending price bundle auction," in Proc. ACM Conference on Electronic Commerce (EC-99), Denver, 1999, pp. 148-157.
[14]	N. Sadeh and M. S. Fox, "Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem," Artificial Intelligence, vol. 86, pp. 1-41, 1996.
[15]	P. S. Ow, "Focused Scheduling in Proportionate Flowshops," Management Science, vol. 31, pp. 852-869, 1985.
[16]	M. M. Vig and K. J. Dooley, "Dynamic rules for due-date assignment," International Journal of Production Research, vol. 29, pp. 1361-1377, 1991.
[17]	V. S. Gordon, "A note on optimal assignment of slack due-dates in single-machine scheduling," European Journal of Operational Research, vol. 70, pp. 311-315, 1993.
[18]	T. C. E. Cheng, "Optimal total-work-content-power due-date determination and sequencing," Computers & Mathematics with Applications, vol. 14, pp. 579-582, 1987.
[19]	J. Chuzhoy, R. Ostrovsky, and Y. Rabani, "Approximation algorithms for the job interval selection problem and related scheduling problems," Mathematics of Operations Research, vol. 31, pp. 730-738, 2006.
[20]	K. Charnsirisakskul, P. M. Griffin, and P. Keskinocak, "Order selection and scheduling with leadtime flexibility," IIE Transactions, vol. 36, pp. 697-707, 2004.
[21]	N. P. Dellaert, "Due-date setting and production control," International Journal of Production Economics, vol. 23, pp. 59-67, 1991.
[22]	I. Duenyas, "Single facility due date setting with multiple customer classes," Management Science, vol. 41, pp. 608-619, 1995.
[23]	P. Keskinocak, R. Ravi, and S. Tayur, "Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues," Management Science, vol. 47, pp. 264-279, 2001.
[24]	S. Chatterjee, S. A. Slotnick, and M. J. Sobel, "Delivery guarantees and the interdependence of marketing and operations," Production and Operations Management, vol. 11, pp. 393-410, 2002.
[25]	K. Charnsirisakskul, P. M. Griffin, and P. Keskinocak, "Pricing and scheduling decisions with leadtime flexibility," European Journal of Operational Research, vol. 171, pp. 153-169, 2006.
[26]	S. Ray and E. M. Jewkes, "Customer lead time management when both demand and price are lead time sensitive," European Journal of Operational Research, vol. 153, pp. 769-781, 2004.
[27]	T. Boyaci and S. Ray, "Product differentiation and capacity cost interaction in time and price sensitive markets," Manufacturing & Service Operations Management, vol. 5, pp. 18-36, 2003.
[28]	F. F. Easton and D. R. Moodie, "Pricing and lead time decisions for make-to-order firms with contingent orders," European Journal of Operational Research, vol. 116, pp. 305-318, 1999.
[29]	D. R. Moodie, "Demand management: the evaluation of price and due date negotiation strategies using simulation," Production and Operations Management, vol. 8, pp. 151–162, 1999.
[30]	D. R. Moodie and P. M. Bobrowski, "Due date demand management: negotiating the trade-off between price and delivery," International Journal of Production Research, vol. 37, pp. 997-1021, 1999.
[31]	M. P. Wellman, W. E. Walsh, P. R. Wurman, and J. K. MacKie-Mason, "Auction protocols for decentralized scheduling," Games and Economic Behavior, vol. 35, pp. 271-303, 2001.
[32]	F. Ygge and H. Akkermans, "Power load management as a computational market," in Proc. 2nd International Conference on Multiagent Systems,, Menlo Park, CA, 1996, pp. 393–400.
[33]	W. E. Walsh and M. P. Wellman, "Efficiency and equilibrium in task allocation economies with hierarchical dependencies," in Proc. 6th International Joint Conference on Artificial Intelligence, Stockholm, 1999, pp. 520-526.
[34]	M. P. Wellman, "A computational market model for distributed configuration design," AI EDAM, vol. 9, pp. 125-133, 1995.
[35]	C. Boutilier, M. Goldszmidt, and B. Sabata, "Sequential auctions for the allocation of resources with complementarities," in Proc. 16th International Joint Conference on Artificial Intelligence (IJCAI-99), Stockholm, 1999, pp. 527-534.
[36]	R. Engelbrecht-Wiggans and R. J. Weber, "A sequential auction involving asymmetrically-informed bidders," International Journal of Game Theory, vol. 12, pp. 123-127, 1983.
[37]	R. P. McAfee and J. McMillan, "Analyzing the airwaves auction," The Journal of Economic Perspectives, vol. 10, pp. 159-175, 1996.
[38]	D. M. Reeves, M. P. Wellman, J. K. MacKie-Mason, and A. Osepayshvili, "Exploring bidding strategies for market-based scheduling," Decision Support Systems, vol. 39, pp. 67-85, 2005.
[39]	D. C. Parkes and L. H. Ungar, "An auction-based method for decentralized train scheduling," in Proc. 5th International Conference on Autonomous Agents, Montreal, Quebec, 2001, pp. 43-50.
[40]	E. Kutanoglu and S. D. Wu, "Incentive compatible, collaborative production scheduling with simple communication among distributed agents," International Journal of Production Research, vol. 44, pp. 421-446, 2006.
[41]	S. de Vries and R. V. Vohra, "Combinatorial auctions: a survey," INFORMS Journal on Computing, vol. 15, pp. 284-309, 2003.
[42]	T. Sandholm, S. Suri, A. Gilpin, and D. Levine, "CABOB: a fast optimal algorithm for winner determination in combinatorial auctions," Management Science, vol. 51, pp. 374-390, 2005.
[43]	T. Sandholm, "Algorithm for optimal winner determination in combinatorial auctions," Artificial Intelligence, vol. 135, pp. 1-54, 2002.
[44]	D. C. Parkes and L. H. Ungar, "Iterative combinatorial auctions: theory and practice," in Proc. 17th National Conference on Artificial Intelligence, Austin, TX. , 2000, pp. 74–81.
[45]	S. Bikhchandani and J. M. Ostroy, "Ascending price Vickrey auctions," Games and Economic Behavior, vol. 55, pp. 215-241, 2006.
[46]	E. Kutanoglu and S. D. Wu, "On combinatorial auction and Lagrangean relaxation for distributed resource scheduling," IIE Transactions, vol. 31, pp. 813-826, 1999.
[47]	P. Milgrom, "Putting auction theory to work: the simultaneous ascending auction," Journal of Political Economy, vol. 108, pp. 245-272, 2000.
[48]	C. Boutilier and H. H. Hoos, "Bidding languages for combinatorial auctions," in Proc. 17th International Joint Conference on Artificial Intelligence, Seattle, Washington, 2001, pp. 1211–1217.
[49]	T. W. Sandholm, "Distributed rational decision making," in Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, Cambridge, MA: MIT Press, 1999.
[50]	J. K. Mackie-Mason, A. Osepayshvili, D. M. Reeves, and M. P. Wellman, "Price prediction strategies for market-based scheduling," in Proc. 14th International Conference on Automated Planning and Scheduling, Whistler, BC, 2004.
[51]	C. Wang, H. Ghenniwa, and W. Shen, "Bidding languages for auction-based distributed scheduling," in Proc. 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, Texas, 2009, pp. 4518-4523.
[52]	R. G. Smith, "The contract net protocol: High-level communication and control in a distributed problem solver," IEEE Transactions on computers, vol. 100, pp. 1104-1113, 1980.
[53]	W. Shen, L. Wang, and H. Qi, "Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey," IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, vol. 36, pp. 563-577, 2006.
[54]	W. Shen, "Distributed manufacturing scheduling using intelligent agents," Intelligent Systems, IEEE, vol. 17, pp. 88-94, 2002.
[55]	S. Bikhchandani and J. M. Ostroy, "The package assignment model," Journal of Economic Theory, vol. 107, pp. 377-406, 2002.
[56]	L. M. Ausubel and P. Milgrom, "Ascending auctions with package bidding," Frontiers of Theoretical Economics, vol. 1, pp. 1-42, 2002.