How to cite this paper
Mauergauz, Y. (2015). Scheduling for production teams.International Journal of Industrial Engineering Computations , 6(3), 339-350.
Refrences
Bai, D., & Tang, L. (2013). Open shop scheduling problem to minimize makespan with release dates. Applied Mathematical Modeling, 37, 2008-2015.
Blackburn, J., & Millen, R. (1986). Perspectives on flexibility in manufacturing: hardware versus software. Modeling and DeMgn of Flexible Manufacturing Systems, 2(2), 116-117.
B?a?ewicz, J., Pesch, E., Sterna, M., & Werner, F. (2004). Open shop scheduling problems with late work criteria. Discrete Applied Mathematics,134(1), 1-24.
Br?sel, H., Herms, A., M?rig, M., Tautenhahn, T., Tusch, J., & Werner, F. (2008). Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. European Journal of Operational Research, 189(3), 856-870.
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.
Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM (JACM), 23(4), 665-679.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey.Annals of discrete mathematics, 5, 287-326.
Gupta, D., Renuka, M., & Singla, P. (2013). Open Shop Scheduling: Minimizing Makespan. Saarbrucken, LAP Lambert.
Leung, J. Y. T., Li, H., & Pinedo, M. (2005). Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8(5), 355-386.
Liaw, C. F. (2005). Scheduling preemptive open shops to minimize total tardiness. European Journal of Operational Research, 162(1), 173-183.
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.
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.
Mauergauz, Y. (2012). Objectives and constraints in advanced planning problems with regard to scale of production output and plan hierarchical level.International Journal of Industrial and Systems Engineering, 12(4), 369-393.
Mauergauz, Y. (2013). Cost-efficiency method for production scheduling. InProceedings of the world congress on engineering (Vol. 1, pp. 587-593).
Mauergauz, Y. (2014). Dynamic Pareto-optimal group scheduling for single machine. International Journal of Industrial and Systems Engineering, 16, 537-559.
Naderi, B., Ghomi, S. F., Aminnayeri, M., & Zandieh, M. (2011). Scheduling open shops with parallel machines to minimize total completion time. Journal of Computational and Applied Mathematics, 235(5), 1275-1287.
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.
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.
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).
Blackburn, J., & Millen, R. (1986). Perspectives on flexibility in manufacturing: hardware versus software. Modeling and DeMgn of Flexible Manufacturing Systems, 2(2), 116-117.
B?a?ewicz, J., Pesch, E., Sterna, M., & Werner, F. (2004). Open shop scheduling problems with late work criteria. Discrete Applied Mathematics,134(1), 1-24.
Br?sel, H., Herms, A., M?rig, M., Tautenhahn, T., Tusch, J., & Werner, F. (2008). Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. European Journal of Operational Research, 189(3), 856-870.
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.
Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM (JACM), 23(4), 665-679.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey.Annals of discrete mathematics, 5, 287-326.
Gupta, D., Renuka, M., & Singla, P. (2013). Open Shop Scheduling: Minimizing Makespan. Saarbrucken, LAP Lambert.
Leung, J. Y. T., Li, H., & Pinedo, M. (2005). Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8(5), 355-386.
Liaw, C. F. (2005). Scheduling preemptive open shops to minimize total tardiness. European Journal of Operational Research, 162(1), 173-183.
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.
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.
Mauergauz, Y. (2012). Objectives and constraints in advanced planning problems with regard to scale of production output and plan hierarchical level.International Journal of Industrial and Systems Engineering, 12(4), 369-393.
Mauergauz, Y. (2013). Cost-efficiency method for production scheduling. InProceedings of the world congress on engineering (Vol. 1, pp. 587-593).
Mauergauz, Y. (2014). Dynamic Pareto-optimal group scheduling for single machine. International Journal of Industrial and Systems Engineering, 16, 537-559.
Naderi, B., Ghomi, S. F., Aminnayeri, M., & Zandieh, M. (2011). Scheduling open shops with parallel machines to minimize total completion time. Journal of Computational and Applied Mathematics, 235(5), 1275-1287.
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.
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.
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).