: Lanndon Ocampo, Eppie Clark, Alaine Liggayu
: 1 Department of Industrial Engineering, De La Salle University, 2401 Taft Avenue, 1004 Manila, Philippines
2 Department of Industrial Engineering, University of San Carlos, Cebu City, 6000 Cebu, Philippines
This paper proposes a lot size formulation with the objective of minimizing manufacturing makespan. A simple manufacturing system is considered with single product that is processed through pre-defined task sequence of known tasks, transactional and material handling times. The lot size problem yields a nonlinear optimization model whose solution satisfies the Kuhn-Tucker necessary and sufficient conditions. Results show that lot size is a function of the demand, the transactional activities and the length of the material handling times at the constraint task, and the sum of unconstrained task times. When transactional and material-handling times are considered, optimal lot size is independent of the longest task time but dependent on the sum of the processing times of the unconstrained tasks. The main contribution of this paper is the proposed method of minimizing makespan without spending resources in improving the constraint task but instead, considers developing an optimal lot size. This paper poses relevant applications especially for high-volume manufacturing systems.
:lot size; nonlinear optimization; makespan
Lanndon Ocampo, Eppie Clark, Alaine Liggayu, Lot Size Formulation Minimizing
Makespan with Transactional and Movement Times, Advances in Industrial Engineering and Management, Vol.3, No.2, 2014, pp.13-18, doi: 10.7508/AIEM-V3-N2-13-18
(size: 2.16 MB, pp.13-18
, Download times:
 R. F. Khabibullin, 1989. Operations-oriented batch size problem, Journal of Soviet Mathematics, vol. 44, no. 5, pp. 649-654.
 T. Hamada, 2005. A Bayesian sequential batch-size problem to minimize expected total completion time on a single machine, Journal of the Operations Research Society of Japan, vol. 48, no. 3, pp. 256-268.
 M. van Vyve, 2007. Algorithms for single-item lot sizing problems with constant
batch size, Mathematics of Operations Research, vol. 32, no. 3, pp. 594-613.
 A. Bar-noy, S. Guha, Y. Katz, J. S. Naor, B. Schieber and H. Shachnai, 2008. Throughput maximization of real-time scheduling with batching, ACM Transactions on Algorithms, vol. 5, no. 2, pp. 1-17.
 A. H. Halim, 1994. Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment, European Journal of Operational Research, vol. 72, no. 3, pp. 529-544.
 S. Li, Y. Li, Y. Liu and Y. Xu, 2007. A GA-based NN approach for makespan estimation, Applied Mathematics and Computation, vol. 185, no. 2, pp. 1003-1014.
 V. D. P. Rao, K. V. Subbaiah and V. R. Raju, 2009. Fuzzy genetic approach to economic lot – size scheduling problem, Jordan Journal of Mechanical and Industrial Engineering, vol. 3, no. 1, pp. 9-16.
 N. R. Parsa, B. Karimi and A. H. Kashan, 2010. A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, Computers & Operations Research, vol. 37, no. 10, 1720-1730.
 R. Xu, H. Chen and X. Li, 2012. Makespan minimization on single batch-processing machine via ant colony optimization, Computers & Operations Research, vol. 39, no. 3, pp. 582-593.
 R. Ramezanian, M. Saidi-Mehrabad, and P. Fattahi, 2013. MIP formulation and heuristics for multi-stage capacitated lot-sizing and scheduling problem with availability constraints, Journal of Manufacturing Systems, vol. 32, no. 2, pp. 392-401.
 N. Hanenkamp, 2013. The process model for shop floor management implementation, Advances in Industrial Engineering and Management, vol. 2, no. 1, pp. 40-46.
 W. Stevenson, 2012. Operations Management, 11th ed., McGraw-Hill: New York.