منابع مقالات علمی : زمان بندی ماشین های موازی نامرتبط به همراه دوباره کاری با در نظر گرفتن …

[۱۴] Horowitz. E., and Sahni. S,. 1976. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23(2):317–۲۷٫
[۱۵] Lancia, G., 2000. Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the Makespan, European Journal of Operational Research, ۱۲۰ (۲), ۲۷۷–۲۸۸٫
[۱۶] Fanjul-Peyro, L. and Ruiz, R., 2011.Size-reduction heuristics for the unrelated parallel machines scheduling problem. Computers & Operations Research,38, 301-309.
[۱۷] Fanjul-Peyro, L. and Ruiz, R., 2012.Scheduling unrelated parallel machines with optional machines and job selection. Computers & Operations Research, ۳۹, ۱۷۴۵-۱۷۵۳٫
[۱۸] Liaw, C.Y., Lin, Y.K., Chen, C.Y., and Chen, M., 2003. Scheduling unrelated parallel machines to minimize total weighted tardiness, Computers & Operations Research, ۳۰(۱۲), ۱۷۷۷–۱۷۸۹٫
[۱۹] Rodriguez, F., Lozano, M., Blum, C., and Garcia-Martinez, C., 2013. Computers & Operations Research, ۴۰, ۱۸۲۹-۱۸۴۱٫
[۲۰] Lin, Y., Pfund, M., and Fowler, J. (2011). Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Computers & Operations Research, 38, 901–۹۱۶٫
[۲۱] Lin, Y., Fowler, J., and Pfund, M. (2013). Multiple-objective heuristics for scheduling unrelated parallel machines. European Journal of Operational Research,
[۲۲] Yang, D.L., Cheng, T.C.E., Yang, S.J., and Hsu, C.J., 2012. Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities. Computers & Operations Research, 39, 1458-1464.
[۲۳] Cheng, T. C. E., Hsu, C.-J., and Yang, D.-L. 2011. Unrelated parallel-machine scheduling with deteriorating maintenance activities. Computers and Industrial Engineering, 60, 602–۶۰۵٫
[۲۴] Flapper, S.D.P., Fransoo, J.C., Broekmeulen, R.A.C.M. and Inderfurth, K., 2002. Planning and control of rework in the process industries: a review, Production Planning & Control, 1, 26–۳۴٫
[۲۵] Liu, L,. and Zhou, H., 2013. On the identical parallel-machine rescheduling with job rework disruption. Computers & Industrial Engineering.
[۲۶] Ramezanian, R., and Saidi-Mehrabad, M. 2012. Multi-product unrelated parallel machines scheduling problem with rework processes. Scientica Iranica, Transactions E: Industrial Engineering, ۱۹(۶), ۱۸۸۷-۱۸۹۳٫
[۲۷] Kang, Y. H., Kim, S. S., and Shin, H. J., 2010. A dispatching algorithm for parallel machines with rework processes. Journal of the Operational Research Society, 61(1), 144–۱۵۵٫
[۲۸] Teunter, R.H. and Flapper, S.D.P., 2003.Lot-sizing for a single-stage single product production system with rework of perishable production defectives, OR Spectrum, 25, 85–۹۶٫
[۲۹] Flapper, S.D.P. and Teunter, R.H., 2004.Logistic planning of rework with deteriorating work in process, International Journal of Production Economics, ۸۸, ۵۱–۵۹٫
[۳۰] Minner, S., Lindner, G., 2004.Lot sizing decisions in product recovery management. In: Dekker, R., Fleischmann, M., Inderfurth, K., van Wassenhove, L.N. (Eds.), Reverse Logistics—Quantitative Models for Closed-Loop Supply Chains. Springer, Berlin, pp. 157–۱۷۹٫
[۳۱] Inderfurth, K., Janiak, A., Kovalyov, M.Y. and Werner, F., 2006. Batching work and rework processes with limited deterioration of reworkables. Computers and Operations Research, ۳۳, ۱۵۹۵–۱۶۰۵٫
[۳۲] Inderfurth, K., Kovalyov, M.Y., Ng, C.T. and Werner, F., 2007. Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables. International Journal of Production Economics, ۱۰۵, ۳۴۵–۳۵۶٫
[۳۳] Haji, R., Haji, A., Sajadifar, M. and Zolfaghari, S., 2008. Lot sizing with non-zero setup times for rework. Journal of Systems Science and Systems Engineering, 17, 230–۲۴۰٫
[۳۴] Gribkovskaia, I., Kovalev, S., and Werner, F., 2010. Batching for work and rework processes on dedicated facilities to minimize the makespan. Omega, ۳۸, ۵۲۲-۵۲۷٫
[۳۵] Tavakkoli-Moghaddam, R., Taheri, F., Bazzazi, M., Izadi, M., and Sassani, F., 2009. Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence dependent setup times and precedence constraints. Computers & Operations Research, ۳۶, ۳۲۲۴-۳۲۳۰٫
[۳۶] Luo, X., Chu, F., 2006. A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness. Applied Mathematics and Computation ۱۸۳, ۵۷۵–۵۸۸٫
[۳۷] Arroyo, J.E.C., Nunes, G.V.P., Kamke, E.H., 2009. Iterative local search heuristic for the single machine scheduling problem with sequence dependent setup times and due dates. Proceedings of the 9th International Conference on Hybrid Intelligent Systems, ۱۰۴, ۵۰۵–۵۱۰٫
[۳۸] Panwalkar, S.S., Dudek, R.A., and Smith, M.L., 1973. Sequence research and the industrial scheduling problem. Proceedings of the Symposium on the theory of scheduling and it applications, pp. 29–۳۸٫
[۳۹] Flynn, B.B., 1987. The effect of setup time on output capacity in cellular manufacturing, International Journal of Production Research, 25, 1761-1772.
[۴۰] Wortman, D.B., 1992. Meaning capacity: getting the most from your firm’s assets. Industrial Engineering Journal, ۲۷, ۴۷-۴۹٫