Call for Paper - Upcoming Issues

A Review of Manufacturing Teams

International Journal of Industrial Engineering
© 2015 by SSRG - IJIE Journal
Volume 2 Issue 3
Year of Publication : 2015
Authors : M.Juswin and Dr.Yuvasree
10.14445/23499362/IJIE-V2I5P101
pdf
How to Cite?

M.Juswin and Dr.Yuvasree, "A Review of Manufacturing Teams," SSRG International Journal of Industrial Engineering, vol. 2,  no. 3, pp. 1-4, 2015. Crossref, https://doi.org/10.14445/23499362/IJIE-V2I5P101

Abstract:

This paper is presents a method of calendar that means scheduling for manufacturing teams, when the average orders effectiveness function is used as the superiority criterion. The method is based on the perception of “production intensity”, which is a dynamic parameter of construction process. Applied software package allows scheduling for medium quantity of jobs. The result of software application is the team load on the planning horizon. The computed plan may be corrected and recalculated in interactive mode. Present load of every team is taken into account at each recalculation. The method may be used for any amalgamation of complex and specialized teams.

Keywords:

Scheduling, Production intensity, Order utility.

References:

[1] Bai, D., & Tang, L. (2013). Open shop scheduling problem to minimize makespan with release dates. Applied Mathematical Modeling, 37, 2008-2015. 
[2] Blackburn, J., & Millen, R. (1986). Perspectives on flexibility in manufacturing: hardware versus software. Modeling and DeMgn of Flexible Manufacturing Systems, 2(2), 116-117.
[3] Doulabi, S. H. H. (2010). A mixed integer linear formulation for the open shop earliness-tardiness scheduling problem. Appl Math Sci, 4(35), 1703-1710. 
[4] Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM (JACM), 23(4), 665-679.
[5] Mastrolilli, M., Queyranne, M., Schulz, A. S., Svensson, O., & Uhan, N. A. (2010). Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 38(5), 390-395. 
[6] Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2003). Concurrent open shop scheduling to minimize the weighted number of tardy jobs. Journal of Scheduling, 6(4), 405-412.
[7] Shabtay, D., & Kaspi, M. (2006). Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function. Naval Research Logistics (NRL), 53(3), 204-216. 
[8] Witkowski, T., Antczak, P., & Antczak, A. (2012, February). Hybrid method for solving flexible open shop scheduling problem with simulated annealing algorithm and multi-agent approach. In Advanced Materials Research (Vol. 383, pp. 4612-4619).
[9] YanMin Ma, Y. M., & Di Jin, D. J. (2013). Concurrent Open-shop Scheduling Accurate Algorithm Research. International Journal of u-and e-Service, Science and Technology, 6(5), 1-16.