2,460
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Production improvement with flow shop scheduling heuristics in Household utensils manufacturing company

, & | (Reviewing Editor)
Article: 1430007 | Received 01 Aug 2017, Accepted 16 Jan 2018, Published online: 30 Jan 2018

References

  • Alharkan, I. M. (2005). Algorithms for sequencing and scheduling . Riyadha: Industrial Engineering Department, College of Engineering, King Saud University.
  • Ancău, M. (2012). On solving flowshop scheduling problems. Proceeding of the Romania Academy, Series A , 13 (1), 71–79.
  • Artiba, A. , Abdelhakim, V. V. Emelyanov , & Lassinovski. S. L. (2012). Introduction to intelligent simulation: The RAO Language . Dordrecht: Springer Science & Business Media.
  • Atter, K. I. (2011). Optimal production scheduling: Case study texstyle Ghana limited Tema (Doctoral dissertation). Kumasi: KNSUT.
  • Baker, K. R. (1974). Introduction to sequencing and scheduling . New York, NY : Wiley.
  • Campbell, H. G. , Dudek, R. A. , & Smith, M. L. (1970). A heuristic algorithm for the ‘n’ job, ‘m’ machine sequencing problem . USA: INFORMS.
  • Chakraborty, U. K. , & Laha, D. (2007). An improved heuristic for permutation flowshop scheduling. International Journal of Information and Communication Technology , 1 (1), 89–97.10.1504/IJICT.2007.013279
  • Frauendorfer, K. , & Konigsperger, E. (1996). Concepts for improving scheduling decisions: An application in the chemical industry. International Journal of Production Economics , 46–47 , 27–38.
  • Gupta, J. N. , & Stafford, E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research , 169 (3), 699–711.10.1016/j.ejor.2005.02.001
  • Johnson, S. N. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly , 1 (1), 61–68.10.1002/(ISSN)1931-9193
  • Krajewski, L. J. , Ritzman, L. P. , & Malhotra, M. K. (1999). Operation management . Reading, MA: Addison Wesley.
  • Kumar, S. , & Tayal, R. K. (2012). Metaheuristic designed for calculating makespan of comprehensive scheduling problems. In National conference on trends and advantages in mechanical engineering (pp. 827–832). Faridabad: YMCA University of Science & Technology.
  • Mohammadi, G. (2015). Multi-Objective flow shop production scheduling via robust genetic algorithm optimization technique. International Journal of Service Science, Management and Engineering , 2 , 1–8.
  • Muni Babu, P. , Himasekhar Sai, B. V. , & Sreenivasulu Reddy, A. (2015). Optimization of make-span and total tardiness for flow-shop scheduling using genetic algorithm. International Journal of Engineering Research and General Science , 0 , 195–199.
  • Nawaz, M. , Enscore, Jr., E. E. , & Ham, I. (1983). A heuristic algorithm for the ‘m’-machine, n-job flow-shop sequencing problem. The International Journal of Management Science , 11 (1), 91–95.
  • Park, Y. (1981). A simulation study and an analysis for evaluation of performance-effectiveness of flow shop sequencing heuristics: A static and dynamic flow shop model (Master’s Thesis). Pennsylvania State University, State College, PA.
  • Pervaiz, I. , & Sehik Uduman, P. S. (2014). Genetic algorithm for permutation flowshop scheduling problem to minimize makespan. International Journal of Computing Algorithms , 3 , 1086–1091.
  • Pinedo, M. (1995). Scheduling theory, algorithm, and systems . New York, NY : Prentice Hall.
  • Pugazhenthi, R. , Anthony Xavior, M. , & Arul, Kumar V. (2014). Application of genetic algorithm in flowshop to minimize makespan. International Journal of Mechanical and Production Engineering , 2 (4), 77–80.
  • Rajpathak, D. G. (2001). Intelligent scheduling - A literature review . Milton Keynes: KMI-TR.
  • Robert Jacobs, F. , Berry, William L. , Clay Whybark, D. , & Vollman, T. E. (2005). Manufacturing planning and control for supply chain management . Singapore: McGraw-Hill Education.
  • Sun, J. , & Xue, D. (2001). A dynamic reactive scheduling mechanism for responding to changes of production orders and manufacturing resources. Computers in Industry , 46 (2), 189–207.10.1016/S0166-3615(01)00119-1
  • Taillard, E. (1990). Some efficient heuristic methods for the flow-shop sequencing problem. European Journal of Operational Research , 47 (1), 67–74.