253
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

SIMULTANEOUS PRICING, DUE-DATE SETTING AND SCHEDULING FOR MAKE-TO-ORDER FIRMS WITH CONTINGENT ORDERS

&
Pages 32-43 | Received 01 May 2008, Accepted 01 Aug 2008, Published online: 09 Feb 2010

REFERENCES

  • Cakravasti , A. and Nakamuraji , N. 2002 . Model for negotiating the price and due date for a single order with multiple suppliers in a make-to-order environment . International Journal of Production Research , 40 : 3425 – 3440 .
  • Charnsirisakskul , K. , Griffin , P. and Keskinocak , P. 2006 . Pricing and scheduling decisions with lead time flexibility . European Journal of Operational Research , 171 : 153 – 190 .
  • Easton , F. F. and Moodie , D. R. 1999 . Pricing and lead time decisions for make-to-order firms with contingent orders . European Journal of Operational Research , 116 : 305 – 318 .
  • Elhafsi , M. 2000 . An operational decision model for lead-time and price quotation in congested manufacturing systems . European Journal of Operational Research , 126 : 355 – 370 .
  • Glover , B. 1977 . A statistical approach to the TSP . Networks , 7 : 205 – 229 .
  • Haskose , A. , Kingsman , B. G. and Worthington , D. 2004 . Performance analysis of make-to-order manufacturing systems under different workload control regimes . International Journal of Production Economics , 90 : 169 – 182 .
  • Jahnukainen , J. and Lahti , M. 1999 . Efficient purchasing in make-to-order supply chains . International Journal of Production Economics , 59 : 103 – 111 .
  • Keskinocak , P. , Ravi , R. and Tayur , S. 2001 . Scheduling and reliable lead-time quotation for orders for availability intervals and lead-time sensitive revenues . Management Science , 47 : 264 – 279 .
  • Kirkpatrick , S. , Gelatt , C. D. and Vecchi , M. P. 1983 . Optimization by simulated annealing . Science , 220 : 167 – 175 .
  • Lederer , P. J. and Li , L. 1997 . Pricing, production, scheduling, and delivery-time competitive . Operations Research , 45 : 407 – 420 .
  • Lee , I. 2001 . Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs . Computers and Operations Research , 28 : 835 – 852 .
  • Liu , M. and Wu , C. 2006 . Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems . Robotics and Computer-Integrated Manufacturing , 22 : 279 – 287 .
  • Park , M. W. and Kim , Y. D. 1997 . Search heuristic for a parallel machine scheduling problem with ready times and due dates . Computers and Industrial Engineering , 33 : 793 – 796 .
  • Pinedo , M. 2000 . Scheduling: Theory, Algorithms, and Systems NY : Prentice-Hall .
  • Ray , S. and Jewkes , E. M. 2004 . Customer lead time management when both demand and price are lead time sensitive . European Journal of Operational Research , 153 : 769 – 781 .
  • Skiscim , C. C. and Golden , B. L. 1983 . “ Optimization by simulated annealing: a preliminary computational study for the TSP ” . In Proceedings of the 15th Conference on Winter Simulation 525 – 535 . Arlington, Virginia Dec. 12–14
  • Tan , K. C. , Lee , L. H. and Ou , K. 2001 . Artificial intelligence heuristics in solving vehicle routing problems with time window constraints . Engineering Application of Artificial Intelligence , 14 : 825 – 837 .
  • Watanapa , B. and Techanitisawad , A. 2005 . Simultaneous price and due date settings for multiple customer classes . European Journal of Operational Research , 166 : 351 – 368 .
  • Webster , S. 2002 . Dynamic pricing and lead-time policies for make-to-order systems . Decision Sciences , 33 : 579 – 599 .

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.