Negotiating price/delivery date in a stochastic manufacturing environment

IIE Transactions - Tập 31 - Trang 255-270 - 1999
MOHSEN ELHAFSI1, ERIK ROLLAND2
1The A. Gary Anderson Graduate School of Management, University of California, Riverside, USA
2Fisher College of Business, The Ohio State University, Columbus, USA

Tóm tắt

We study a make-to-order manufacturing system consisting of several processing centers that are subject to failures and repairs. Our objective is to build a model that can be used as a tool for negotiating the delivery date and the price of a certain upcoming order. The model takes into account the congestion level of the shop floor at the time the order is placed. Based on the workload of the processing centers, the model splits the order into lots and assigns them to the processing centers so as to determine the order completion time associated with the minimum operating cost. The efficiency of the solution method for the model allows real-time decision-making while negotiating the price and delivery date of the order to be placed. Since the decisions are made based on a snapshot of the congestion level at the shop floor, using this model will reduce the conflict between the marketing and the production activities in manufacturing organizations.

Tài liệu tham khảo

Blackburn, J. (1991) Time Based Competition, Irwin, Homewood, IL.

Dudek, R.A., Panwalker, S.S. and Smith, M.L. (1992) The lessons of flowshop scheduling research. Operations Research, 40, 7–13.

Eilon, S. and Chowdhury, I.G. (1976) Due dates in job shop scheduling. International Journal of Production Research, 14, 223–237.

Weeks, J.K. (1979) A simulation study of predictable due dates. Management Science, 25, 363–373.

Seidmann, A. and Smith, M.L. (1981) Due date assignment for production systems. Management Science, 27, 571–581.

Baker, K.R. and Bertrand, J.W.M. (1981) An investigation of due-date assignment rules with constrained tightness. Journal of Operations Management, 1, 109–120.

Baker, K. and Bertrand, J.W.M. (1981) A comparison of due-date selection rules. AIIE Transactions, 13, 123–131.

Bertrand, J.W.M. (1983) The e.ect of workload dependent due-dates on job shop performance. Management Science, 29, 799–816.

Baker, K.R. (1984) Sequencing rules and due-date assignments in a job shop. Management Science, 30, 1093–1104.

Bookbinder, J.H. and Noor, A. (1985) Setting job-shop due-dates with service-level constraints. Journal of the Operational Research Society, 36, 1017–1026.

Shanthikumar, J.G. and Sumita, U. (1988) Approximations for the time spent in a dynamic job shop with applications to due-date assignment. International Journal of Production Research, 26 1329–1352.

Wein, L. (1991) Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Science, 37, 834–850.

Chand, S. and Chhajed, D. (1992) A single model for determi nation of optimal due dates and sequence. Operations Research, 40, 596–602.

Wein, L., Whang, S. and Lemire, L.J. (1990) Due date setting and pricing in a single-server queue. Technical Report, Sloan School of Management, M.I.T., Cambridge MA.

Duenyas, I. and Hopp, W.J. (1995) Quoting customer lead times. Management Science, 41, 43–57.

Duenyas, I. (1995) Single facility due date setting with multiple customer classes. Management Science, 41, 608–619.

Sivazlian, B.D. (1992) The filtered counting process and its applications to stochastic manufacturing systems. Research Report 92–13, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA.

Nahmias, S. (1993) Production and Operations Management, Irwin, Homewood, IL.

Barlow, R.E. and Proschan, F. (1965) Mathematical Theory and Reliability, John Wiley & Sons, NY.

Murty, K.G. (1968) Solving the fixed charge problem by ranking the extreme points. Operations Research, 16, 268–279.

Horst, R., Pardalos, P.M. and Thoai, N.V. (1995) Introduction to Global Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, pp. 82–83.

Ghosh, M. and Meeden, G. (1977) On the non-attainability of Chebychev bounds. American Statistician, 31, 35–36.

Thông tin
Thông tin xuất bản

IIE Transactions

Tập 31

255-270

Thông tin tác giả