Document Type : Research Paper
Authors
^{1} گروه مهندسی صنایع دانشگاه کردستان، سنندح، ایران
^{2} مهندسی صنایع دانشگاه کردستان، سنندح، ایران
Abstract
Keywords
10. Gharbi, A., and Haouari, M. (2005). “Optimal Parallel Machines Scheduling with Availability Constraints”, Discrete Applied Mathematics, Vol. 148, No. 1, PP. 63–87.
11. Sheen, G. J., Liao, L. W., and Lin, C. F. (2008). “Optimal Parallel Machines Scheduling with Machine Availability and Eligibility Constraints”, International Journal of Advanced Manufacturing Technology, Vol. 36, No. 1 and 2, PP. 132–139.
12. Shen, L., Wang, D., and Wang, X. Y. (2013). “Parallel-Machine Scheduling with Non-Simultaneous Machine Available Time”, Applied Mathematical Modelling, Vol. 37, No. 7, PP. 5227–5232.
13. Huo, Y., and Zhao, H. (2015). “Total Completion Time Minimization on Multiple Machines Subject to Machine Availability and Makespan Constraints”, European Journal of Operational Research, Vol. 243, No. 2, PP. 547–554.
14. Lee, W. C., Wang, J. Y., and Lee, L. Y. (2015). “A Hybrid Genetic Algorithm for an Identical Parallel-Machine Problem with Maintenance Activity”, Journal of the Operational Research Society, Vol. 66, No. 11, PP. 1906–1918.
15. Yin, Y., Wang, Y., Cheng, T. C. E., Liu, W., and Li, J. (2017). “Parallel-Machine Scheduling of Deteriorating Jobs with Potential Machine Disruptions”, Omega, Vol. 69, PP. 17–28.
16. Suresh V., and Ghaudhuri, D. (1996). “Scheduling of Unrelated Parallel Machines When Machine Availability Is Specified”, Production Planning and Control, Vol. 7, No. 4, PP. 393–400.
17. Baiazidi, M. (2014). “Group Scheduling Problem on Unrelated Parallel Machines with Availability Constraints and Sequence Dependent Setup Times”, Msc Thesis, University of Kurdistan.
18. Jiang, D., and Tan, J. (2016). “Scheduling with Job Rejection and Nonsimultaneous Machine Available Time on Unrelated Parallel Machines”, Theoretical Computer Science, Vol. 616, PP. 94–99.
19. Atashpaz-Gargari, E., and Lucas, C. (2007). “Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialistic Competition”, IEEE Congress on Evolutionary Computation, PP. 4661–4667.
20. Norouzi, N., Tavakkoli-Moghaddam, R., Sadegh-Amalnick, M., and Khaefi, S. (2015). “New Mathematical Modeling for a Facilities Location and Vehicle Routing Problem Solving by a Hybrid Imperialist Competitive Algorithm”, Journal of Industrial Engineering (University of Tehran), Vol. 49, No. 1, PP. 129–137.
21. Ahmadizar, F., and Farhadi, S. (2015). “Single-Machine Batch Delivery Scheduling with Job Release Dates, Due Windows and Earliness, Tardiness, Holding and Delivery Costs”, Computers and Operations Research, Vol. 53, PP. 194–205.
22. Fallah Sanami, S., Ramezanian, R., and Shafiei Nikabadi, M. (2016). “Simultaneous Lot-Sizing and Scheduling in Hybrid Flow Shop Production Environment with Resource Constraint”, Journal of Industrial Engineering (University of Tehran), Vol. 50, No. 2, PP. 295–310.
23. Yazdani, M., Aleti, A., Khalili, S. M., and Jolai, F. (2017). “Optimizing the Sum of Maximum Earliness and Tardiness of the Job Shop Scheduling Problem”, Computers and Industrial Engineering, Vol. 107, PP. 12–24.
24. Panahi, I., and Nahavandi, N. (2017). “An Efficient Imperialist Competitive Algorithm for Resource Constrained Project Scheduling Problem”, Journal of Industrial Engineering (University of Tehran), Vol. 51, No. 2, PP. 161–174.
25. Afzalirad, M., and Rezaeian, J. (2017). “A Realistic Variant of Bi-Objective Unrelated Parallel Machine Scheduling Problem: NSGA-II And MOACO Approaches”, Applied Soft Computing, Vol. 50, PP. 109–123.
26. Radhakrishnan, S., and Ventura, J. A. (2000). “Simulated Annealing for Parallel Machine Scheduling with Earliness-Tardiness Penalties and Sequence-Dependent Set-Up Times”, International Journal of Production Research, Vol. 38, No. 10, PP. 2233–2252.