IJE TRANSACTIONS A: Basics Vol. 20, No. 3 (October 2007) 263-280   

PDF URL: http://www.ije.ir/Vol20/No3/A/6-861.pdf  
downloaded Downloaded: 64   viewed Viewed: 1982

G. Mokhtari* and F. Kianfar

Department of Industrial Engineering, Sharif University of Technology
Tehran, Iran
mokhtari@behsad.com - fkianfar@sharif.edu
*Corresponding Author
( Received: January 31, 2007 – Accepted in Revised Form: September 13, 2007 )

Abstract    Due date assignment for customer orders has been studied in various productionenvironments using different modeling approaches. In this paper the researchers consider aproduction system in which the orders of several customers are produced in a single batch because ofthe economy of scale. If a batch is completed before receiving customer orders, inventory carryingcost is incurred but if it is completed after receiving customer orders, shortage cost is incurred andfinally if the order is delivered after its due date, tardiness cost is charged. The problem is to decideon batch size, due date of batch (imposed on supply process) and lead time (to be quoted to the nextcoming customers) so that relevant costs are minimized. The objective function is to minimize totalcost of supply, inventory carrying, shortage and tardiness. Production flow times are probabilisticwhich follow a probability distribution. The proposed model is solved using real-coded geneticalgorithms and numerical results are presented. This work was motivated by a heavy equipmentproduction system which has some products with relatively low demand rates, high prices and longsupply lead times.


Keywords    Due Date Assignment, Lot-Sizing, Lead Time Quotation, Real-Coded Genetic Algorithms



1. Dupon, A., Van Nieuwenhuyse, I. and Vandaele, N., “The impact of sequence changes on product lead time”, Robotics and Computer Integrated Manufacturing, Vol. 18, (2002), 327-333.

2. Claudio Garavelli, A., “Performance analysis of a batch production system with limited flexibility”, Int. J. Production Economics, Vol. 69, (2001), 39-48.

3. Haskose, A., Kingsman, B. G. and Worthington, D., “Performance analysis of make-to-order manufacturing systems under different workload control regimes”, Int. J. Production Economics, Vol. 90, (2004), 169-186.

4. Dolgui, A. and Ould-Louly, M.A., “A model for supply planning under lead time uncertainty”, Int. J. Production Economics,Vol. 78, (2002), 145-152.

5. Me´ndez, C. A., Henning, G. P. and Cerda, J., “Optimal scheduling of batch plants satisfying multiple product orders with different due-dates”, Computers and Chemical Engineering, Vol 24, (2000), 2223-2245.

6. Sung, C. S. and Kim, Y. H., “Minimizing due date related performance measures on two batch processing machines”, European Journal of Operational Research, Vol. 147, (2003), 644-656.

7. Sox, C. R., Jackson, P. L., Bowman, A. and Muckstadt, J. A., “A review of the stochastic lot scheduling problem”, Int J. Production Economics, Vol. 62, (1999), 181-200.

8.Moon, C., Kim, J. and Hur, S., “Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain”, Computers and Industrial Engineering, Vol. 43, (2002), 331-349.

9.  Potts, C. N. and Kovalyov, M. Y., ”Scheduling with batching: A review”, European Journal of Operational Research, Vol. 120, (2000), 228-249.

10. Donk, D. P. V., “Make to stock or make to order: The decoupling point in the food processing industries”, Int. J. Production Economics, Vol. 69, (2001), 297-306.

11. Song, D. P., Hicks, C. and Earl, C. F., “Product due date assignment for complex assemblies”, Int. J. Production Economics, Vol. 76, (2002), 243-256.

12. Veral, E. A., “Computer simulation of due-date setting in multi-machine Job Shops”, Computers and Industrial Engineering, Vol. 41, (2001), 77-94.

13.Veral, E. A. and Mohan, R. P., “A two-phased approach to setting due-dates in single machine job shops”, Computers and Industrial Engineering, Vol. 36, (1999), 201-218.

14. Laan, E. V. D., Salomon, M. and Dekker, R., “An investigation of lead-time effects in manufacturing/remanufacturing systems under simple PUSH and PULL control strategies”, European Journal of Operational Research, Vol. 115, (1999), 195-214.

15. Croce, F. D., Gupta, J. N. D. and Tadei, R., “Minimizing tardy jobs in a flowshop with common due date”, European Journal of Operational Research, Vol. 120, (2000), 375-381.

16. Easton, F. F., Moodie, D. R., “Pricing and lead time decisions for make-to-order firms with contingent orders”, European Journal of Operational Research, Vol. 116, (1999), 305-318.

17. Reiner, G. and Trcka, M., “Customized supply chain design: Problems and alternatives for a production company in the food industry. A simulation based analysis”, Int. J. Production Economics, Vol. 89, (2004), 217-229.

18. Habchi, G. and Labrune, Ch., “Study of lot sizes

<!--[if !vml]-->next term
on job shop systems performance using simulation”, Simulation Theory and practice, Vol. 2, (1995), 277-289.

19. Mosheiov, G., “A common due-date assignment problem on parallel identical machines”, Computers and Operations Research, Vol. 28, (2001), 719-732.

20. Mosheiov, G. and Yovel, U., “Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs”, European Journal of Operational Research, Vol. 172, (2006), 528-544.

21. Mosheiova, G. and Oronb, D., Ritovc, Y., “Minimizing flow-time on a single machine with integer batch sizes”, Operations Research Letters, Vol. 33, (2005), 497-501.

22. Soroush, H.M., “Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs”, European Journal of Operational Research, Vol. 113, (1999), 450-468.

23. Ooijen, H.P.G. V. and Bertrand, J.W.M., “Economic due-date setting in job-shops based on routing and workload dependent flow time distribution functions”, Int. J. Production Economics, Vol. 74, (2001), 261-268.

24. Sabuncuoglu, I. and Comlekci, A., “Operation-based flowtime estimation in a dynamic job shop”, Omega, Vol. 30, (2002), 423-442.

25. Gupta, J.N.D., KruK ger, K., Lauff, V., Werner, F., Sotskov, Y.N., “Heuristics for hybrid flow shops with controllable processing times and assignable due dates”, Computers and Operations Research, Vol. 29, (2002), 1417-1439.

26. Jahnukainen, J. and Lahti, M., “Efficient purchasing in make-to-order supply chains”, Int. J. Production Economics, Vol. 59, (1999), 103-111.

27. Bertrand, J. W. M. and Sridharan, V., “A study of simple rules for subcontracting in make-to-order manufacturing”, European Journal of Operational Research, Vol. 128, (2001), 509-531.

28. Bertrand, J. W. M. and Ooijen, H. P. G. V., “Customer order lead times for production based on lead time and tardiness costs”, Int. J. Production Economics, Vol. 64, (2000), 257-265.

29. So, K. C. and Zheng, X., “Impact of supplier's lead time and forecast demand updating on retailer’s order quantity variability in a two-level supply chain”, Int. J. Production Economics, Vol. 86, (2003), 169-179.

30. Ozdamar, L. and Yazgac, T., “Capacity driven due date settings in make to order production systems”, Int. J. Production Economics, Vol. 49, (1997), 29-44.

31. Rodrigues, L. A., Graells, M., Cant, J., Gimeno, L., Rodrigues, M. T. M., Espufta, A. and Puigjaner, L., “Utilization of processing time windows to enhance planning and scheduling in short term multipurpose batch plants”, Computers and Chemical Engineering, Vol. 24, (2000), 353-359.

32. Badell, M. and Puigjaner, L., “Advanced enterprise resource management systems for the batch industry, The TicTacToe algorithm”, Computers and Chemical Engineering, Vol. 25, (2001), 517-538.

33. Hegedus, M. G. and Hopp, W. J., “Due date setting with supply constraints using MRP”, Computers and Industrial Engineering, Vol. 39, (2001), 293-305.

34. ElHafsi, M., “An operational decision model for lead-time and price quotation in congested manufacturing systems”, European Journal of Operational Research, Vol. 126, (2000), 355-370.

35. Park, M. W. and Kim, Y. D., “A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints”, European Journal of Operational Research, Vol. 123, (2000), 504-518.

36. Birman, M., Mosheiov, G., “A note on a due-date assignment on a two-machine flow-shop”, in Computers and Operations Research, Vol. 31, (2004), 473-480.

37. He, Q. M., Jewkes, E. M. and Buzacott, J., “Optimal and near-optimal inventory control policies for a make-to-order inventory-production system”, European Journal of Operational Research, Vol. 141, (2002), 113-132.

38. Kolisch, R., “Integration of assembly and fabrication for make-to-order production”, Int. J. Production Economics, Vol. 68, (2000), 287-306.

39. Ray, S. and Jewkes, E. M., “Customer lead time management when both demand and price are lead time sensitive”, European Journal of Operational Research, Vol. 153, (2004), 769-781.

40. Herrera, F., Lozano, M. and Verdegay, J. L., “Tackling real-coded genetic algorithms: operators and tools for the behavioral analysis”, Artificial Intelligence Reviews, Vol. 12, (1998), 265-319.

41. Houck, C. R., Joines, J. A. and Kay, M. G., “A genetic algorithm for function optimization: A Matlab implementation”, NCSUIE Technical Report, (1995), 95-09.

42. Ling, S. H. and Leung, F. H. F., “An improved genetic algorithm with average-bound crossover and wavelet mutation operations”, Soft Comput, Vol. 11, (2007), 7-31.

43. Arumugam, M. S. and Rao, M. V. C., Palaniappan, R., “New hybrid genetic operators for real coded genetic algorithm to compute optimal control of a class of hybrid systems”, Applied Soft Computing, Vol. 6, (2005), 38-52.

44. Kaelo, P. and Ali, M. M., “Integrated crossover rules in real coded genetic algorithms”, European Journal of Operational Research, Vol. 176, (2007), 60-76.

45. Deep, K. and Thakur, M., “A new crossover operator for real coded genetic algorithms”, Applied Mathematics and Computation, Vol. 188, (2007), 895-911.

46. Eshelman, L. J. and Schaffer, J. D., “Real coded genetic algorithms and interval schemata”, L. Darrell Whitley, editor, FOGA-2. Morgan Kaufmann, (1993), 187-202.

47. Michalewicz, Z., “Genetic algorithms + Data structures = Evolution programs”, Springer-Verlag, NewYork, (1992).

48.  Joines, J. A. and Houck, C. R., “On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with genetic algorithms”, Proceedings of the First IEEE Conference on Evolutionary Computation, (1994), 579-584.

49. Wright, A. H., “Genetic algorithms for real parameter optimization”, G. J. E. Rawlins (Ed.), Foundations of Genetic Algorithms I,Morgan Kaufmann, San Mateo, (1991), 205-218.

50.  Meittinen, K., Makela, M. M. and Toivanen, J., “Numerical comparision of some penalty based constraint handling techniques in genetic algorithms”, Journal of Global Optimization, Vol. 27, (2003), 427-446.

51. Herrera, F., E. Herrera-Viedma, Lozano, M. and Verdegay, J. L., “Fuzzy tools to improve genetic algorithms”, Proc. second European Congress on Intelligent Techniques and Soft Computing, (1994), 1532-1539.

52. Brahimi, N., Peres, S. D., Najid, N. M. and Nordli, A., “Single item lot sizing problems”, European Journal of Operational Research, Vol. 168, (2006), 1-16.

Download PDF 

International Journal of Engineering
E-mail: office@ije.ir
Web Site: http://www.ije.ir