CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Sequencing and scheduling oriented customer driven production planning in CONWIP systems

by Taher Taherian, Samira Bairamzadeh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 41 - Number 14
Year of Publication: 2012
Authors: Taher Taherian, Samira Bairamzadeh
10.5120/5608-7876

Taher Taherian, Samira Bairamzadeh . Sequencing and scheduling oriented customer driven production planning in CONWIP systems. International Journal of Computer Applications. 41, 14 ( March 2012), 18-24. DOI=10.5120/5608-7876

@article{ 10.5120/5608-7876,
author = { Taher Taherian, Samira Bairamzadeh },
title = { Sequencing and scheduling oriented customer driven production planning in CONWIP systems },
journal = { International Journal of Computer Applications },
issue_date = { March 2012 },
volume = { 41 },
number = { 14 },
month = { March },
year = { 2012 },
issn = { 0975-8887 },
pages = { 18-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume41/number14/5608-7876/ },
doi = { 10.5120/5608-7876 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:30:16.808442+05:30
%A Taher Taherian
%A Samira Bairamzadeh
%T Sequencing and scheduling oriented customer driven production planning in CONWIP systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 41
%N 14
%P 18-24
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Encountering the backlog is a common phenomenon in maketo-order production systems. The fluctuations in quantity of orders and delivery lead times of customer orders lead to backlog in delivery of orders. What we are going to develop in this paper is identifying the sequencing and scheduling effects on CONWIP parameters. The sequencing and scheduling objective functions exert some specification in system attributes. In this article we will use some sequencing and scheduling objective function to observe the system parameters alterations for example it is important to minimize the number of tardy jobs and total weighted tardiness causes the mentioned backlogs one by one or simultaneously. Because the different importance of orders, we choose a weighting method to calculate the required weights of orders (jobs) in objective functions optimization procedure. Finally we presented a case study using this method in order to increasing the backlogs.

References
  1. Kosonen, K. and Buhanist, P. 1995. Customer focused lean production development. International Journal of Production Economics 41 (1), 211–216
  2. Chen, H. and Wan, Y-W. 2005. Capacity competition of make-to-order ?rms. Operations Research Letters 33 (2), 187–194.
  3. Wisner, J. D. andSiferd, S. P. 1995. A survey of US manufacturing practices in make to order machine shops. Production and Inventory Management Journal 36 (1), 1–7.
  4. Jodlbauer, H. andStocher, W. 2007. Little's Law in a continuous setting. International Journal of Production Economics 103 (1), 10–16.
  5. Zammori, F. , Braglia, M. and Frosolini, M. (2010). CONWIP card setting in a flow-shop system with a batch processing machine. International Journal of Industrial Engineering Computations, 2 (2011) 593–616.
  6. Duri, C. , Frein, Y. and Lee, H. S. 2000. Performance evaluation and design of a CONWIP system with inspections. International Journal of Production Economics 64 (1), 219–229.
  7. Braglia, M. , Frosolini, R. , Gabbrielli, R. and Zammori, F. 2010. CONWIP card setting in a flow-shop system with a batch processing machine. International Journal of Industrial Engineering Computations, 2, 1–18. Cheng, H. ; Lio, H. (2010).
  8. Erel, E. and 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.
  9. Sheng,Y. andLiu,H. 2009. Improving the delivery ef?ciency of the customer order scheduling problem in a job shop. Computers & Industrial Engineering 57 (9) 856–866.
  10. Kirlik, G. and Oguz, C. 2012. A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Computer & Operations Research. 39(7) 1506-1520.
  11. Chou, F. D. 2009. An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem. Expert Systems with Applications. 36(2) 3857-3865.
  12. Wang, X. and Tang, L. 2009. A population-based variable neighborhood search for the single machine total weighted tardiness problem. Computers & Operations Resarch. 36(6) 2105-2110.
  13. Wang, G. and Cheng, E. 2007. Customer order scheduling to minimize total weighted completion time. Omega, 35 (7) 623 – 626.
  14. Volgenant,A. and Teerhuis, E. 1999. Improved heuristics for the n-job single-machine weighted tardiness problem. Computers & Operations Research, 26 (1) 35-44.
  15. Cheng, T. C. E. , Yuan, J. J. and Liu Z. H. 2005. Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research, 165:423-443, 2005.
  16. Congram, R. K. , Potts, C. N. and Velde D. 2002. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing. 14(1):52-67, 2002.
  17. Taherian, T. , Mohammadi, M. and Bairamzadeh, S. 2011. A Scheduling Based Backlog Reduction Method in CONWIP Production Systems. International Journal of Computer Applications, (0975 – 8887) 32– No. 5.
  18. Du, . J. and Leung, Y. T. 1990. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15:483-495, 1990.
  19. Lee, J-Y. and Kim, Y-D. 2012. Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. Computers & Operations Research. 39(9) 2196-2205.
  20. Wan, G. and Yen, B. 2009. Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs. European Journal of Operational Research. 195(1) 89-97.
  21. Soroush, H. M. 2007. Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem. European Journal of Operational Research. 181(1) 266-287.
  22. Molaee, E. and Moslehi, G. 2010. Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem. Computers & Mathematics with Applications. 60(11) 2909-2919.
  23. Jang, W. and Kelin, C. M. 2002. Minimizing the expected number of tardy jobs when processing times are normally distributed. Operations Research Letters. 30(2) 100-106.
  24. He, C. , Lin, Y. and Yuan, J. 2010. A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. European Journal of Operational Research. 201(3) 966-970.
  25. Lodree, E. , Jang, W. and Kelin, C. M. 2004. A new role for minimizing the number of tardy jobs in dynamic flow shops. European Journal of Operational Research,159(1) 258-263.
Index Terms

Computer Science
Information Sciences

Keywords

Backlog Reduction Constant Work In Process Number Of Tardy Jobs Scheduling

Powered by PhDFocusTM