19 J Chuzhoy R Ostrovsky and Y Rabani Approximation algorithms for the job

19 j chuzhoy r ostrovsky and y rabani approximation

This preview shows page 16 - 17 out of 17 pages.

[19] J. Chuzhoy, R. Ostrovsky, and Y. Rabani, “Approximation algorithms for the job interval selection problem and related scheduling problems,” Math. Oper. Res. , vol. 31, no. 4, pp. 730–738, Nov. 2006. [20] K. Charnsirisakskul, P. M. Griffin, and P. Keskinocak, “Order selection and scheduling with leadtime flexibility,” IIE Trans. , vol. 36, no. 7, pp. 697–707, Jul. 2004. [21] N. P. Dellaert, “Due-date setting and production control,” Int. J. Prod. Econ. , vol. 23, no. 1–3, pp. 59–67, Oct. 1991. [22] I. Duenyas, “Single facility due date setting with multiple customer classes,” Manage. Sci. , vol. 41, no. 4, pp. 608–619, Apr. 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,” Manage. Sci. , vol. 47, no. 2, pp. 264–279, Feb. 2001. [24] S. Chatterjee, S. A. Slotnick, and M. J. Sobel, “Delivery guarantees and the interdependence of marketing and operations,” Prod. Oper. Manage. , vol. 11, no. 3, pp. 393–410, Sep. 2002. [25] K. Charnsirisakskul, P. M. Griffin, and P. Keskinocak, “Pricing and scheduling decisions with leadtime flexibility,” Eur. J. Oper. Res. , vol. 171, no. 1, pp. 153–169, May 2006. [26] S. Ray and E. M. Jewkes, “Customer lead time management when both demand and price are lead time sensitive,” Eur. J. Oper. Res. , vol. 153, no. 3, pp. 769–781, Mar. 2004. [27] T. Boyaci and S. Ray, “Product differentiation and capacity cost interac- tion in time and price sensitive markets,” Manuf. Service Oper. Manage. , vol. 5, no. 1, pp. 18–36, Jan. 2003. [28] F. F. Easton and D. R. Moodie, “Pricing and lead time decisions for make- to-order firms with contingent orders,” Eur. J. Oper. Res. , vol. 116, no. 2, pp. 305–318, Jul. 1999. [29] D. R. Moodie, “Demand management: The evaluation of price and due date negotiation strategies using simulation,” Prod. Oper. Manage. , vol. 8, no. 2, pp. 151–162, Jun. 1999. [30] D. R. Moodie and P. M. Bobrowski, “Due date demand management: Negotiating the trade-off between price and delivery,” Int. J. Prod. Res. , vol. 37, no. 5, pp. 997–1021, Mar. 1999. [31] M. P. Wellman, W. E. Walsh, P. R. Wurman, and J. K. MacKie-Mason, “Auction protocols for decentralized scheduling,” Games Econ. Behav. , vol. 35, no. 1/2, pp. 271–303, Apr. 2001. [32] F. Ygge and H. Akkermans, “Power load management as a computational market,” in Proc. 2nd Int. Conf. Multiagent Syst. , 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 Int. Joint Conf. Artif. Intell. , Stockholm, Sweden, 1999, pp. 520–526. [34] M. P. Wellman, “A computational market model for distributed configura- tion design,” in Proc. AI EDAM , 1995, vol. 9, pp. 125–133. [35] C. Boutilier, M. Goldszmidt, and B. Sabata, “Sequential auctions for the allocation of resources with complementarities,” in Proc. 16th IJCAI , Stockholm, Sweden, 1999, pp. 527–534. [36] R. Engelbrecht-Wiggans and R. J. Weber, “A sequential auction involving asymmetrically-informed bidders,” Int. J. Game Theory , vol. 12, no. 2, pp. 123–127, Jun. 1983.
Image of page 16
Image of page 17

You've reached the end of your free preview.

Want to read all 17 pages?

  • Fall '09
  • 1984, Auction, iterative bidding, XOR0≤i≤mj Rj, lf tj,i

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture