The week's pick
Reseach Article
Article:A Scheduling Based Backlog Reduction Method in CONWIP Production Systems
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 32 - Number 5 |
| Year of Publication: 2011 |
| Authors: T.Taherian, M.Mohammadi, S.Bairamzadeh |
10.5120/3903-5470
|
T.Taherian, M.Mohammadi, S.Bairamzadeh . Article:A Scheduling Based Backlog Reduction Method in CONWIP Production Systems. International Journal of Computer Applications. 32, 5 ( October 2011), 53-59. DOI=10.5120/3903-5470
Abstract
This article develops a scheduling orientation backlog area reduction methodfor customer production planning in a CONWIP controlled production, considering a make to order (MTO) production system. This method can be applied in order to minimize the backlog area by changing the delivery sequences of orders. Changing in sequences causes changes in some order delivery attributes, such delivery lead time of a customer order that can prevent the tardiness in delivery lead time. This changes must be happened in a special period of time called work ahead window (WAW) to insure the production ability of orders that must be delivered in that period of time. One case study has represented in last section of the paper.
References
- Kosonen, K., Buhanist, P., 1995. Customer focused lean production development. International Journal of Production Economics 41 (1), 211–216
- Wisner, J.D., Siferd, S.P., 1995. A survey of US manufacturing practices in make to order machine shops. Production and Inventory Management Journal 36 (1), 1–7.
- Framinan, J.M., Gonzalez, P.L., Ruiz-Usano, R., 2003. The CONWIP production control system: review and research issues. Production Planning & Control 14 (3), 255–265
- Duri, C., Frein, Y., Lee, H.S., 2000. Performance evaluation and design of a CONWIP system with inspections. International Journal of Production Economics 64 (1), 219–229.
- Chen, H., Wan, Y-W., 2005. Capacity competition of make-to-order firms. Operations Research Letters 33 (2), 187–194.
- Jodlbauer, H., Stocher, W., 2007. Little’s Law in a continuous setting. International Journal of Production Economics 103 (1), 10–16.
- Fader, P., Hardie, B., 2009. Probability Models for Customer-Base Analysis. Journal of Interactive Marketing 23 (2009) 61 – 69.
- Audzeyeva, A., Summers, B., Schenk, K., 2011. Forecasting customer behavior in a multi service financial organization :A profitability perspective. International Journal of Forecasting 1 (2011) 357–385.
- Li, J., Yuan, X., Xu, D., 2011. Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness tardiness costs on a single machine. Computers and Mathematics with Applications. 12 (2011) 123–217.
- Cheng, H.,Lio, H., 2010, A coordinated scheduling system for customer orders scheduling problem in job shop environments. Expert Systems with Applications 37 (10) 7831–7837.
- Erel, E., Ghosh, B., 2007. Customer order scheduling on a single machine with family setup times: Complexity and algorithms.Applied Mathematics and Computation 185 (7) 11–18.
- Sheng,Y., Liu,H. 2009. Improving the delivery efficiency of the customer order scheduling problem in a job shop.Computers & Industrial Engineering 57 (9) 856–866.
- Wang,G. Cheng,E. 2007. Customer order scheduling to minimize total weighted completion time.Omega 35 (7) 623 – 626.
- Volgenant,A.Teerhuis,E. 1999.Improved heuristics for the n-job single-machine weighted tardiness problem.Computers & Operations Research 26 (1) 35Ð44.
- Chou,D.2009An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem.Expert Systems with Applications 36 (2009) 3857–3865.
- Wang, X. 2009. A population base variable neighborhood search for the single machine total weighted Tardiness problem.Computers & Operations Research 36 (9) 2105.
Index Terms
Keywords