How to cite this paper
Zarei, M., Davvari, M., Kolahan, F & Wong, K. (2016). Simultaneous selection and scheduling with sequence-dependent setup times, lateness penalties, and machine availability constraint: Heuristic approaches.International Journal of Industrial Engineering Computations , 7(1), 147-160.
Refrences
Ahonen, H., de Alvarenga, A. G., & Provedel, A. (2009). Selection and scheduling in a virtual organisation environment with a service broker. Computers & Industrial Engineering, 57(4), 1353-1362.
Akbaripour, H., & Masehian, E. (2013). Efficient and robust parameter tuning for heuristic algorithms. International Journal of Industrial Engineering & Production Research, 24(2), 143-150.
Allahverdi, A., Ng, C. T., Cheng, T. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985-1032.
Arif, S., Mohammedi, R. D., Hellal, A., & Choucha, A. (2012). A memory simulated annealing method to the unit commitment problem with ramp constraints. Arabian Journal for Science and Engineering, 37(4), 1021-1031.
Baker, K.R. (1974). Introduction to Sequencing and Scheduling. Wiley, NY.
Behnamian, J., & Zandieh, M. (2013). Earliness and tardiness minimizing on a realistic hybrid flowshop scheduling with learning effect by advanced metaheuristic. Arabian Journal for Science and Engineering, 38(5), 1229-1242.
Chen, J. S., Liu, H. S., & Nien, H. Y. (2007). Minimizing makespan in single machine scheduling with job deliveries to one customer area. International Journal of Industiral Engineering-Theory and Applilcations and Practice, 14(2), 203-211.
Chen, S. M., & Chien, C. Y. (2011). Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Systems with Applications, 38(12), 14439-14450.
Conway, R. W., Maxwell, W. L., & Miller, L. W. (2012). Theory of scheduling. Courier Corporation.
Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483-495.
Emmons, H. (1975). One machine sequencing to minimize mean flow time with minimum number tardy. Naval Research Logistics Quarterly, 22(3), 585-592.
Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156-166.
Glover, F. (1994). Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Applied Mathematics, 49(1), 231-255.
Henriksen, A. D., & Traynor, A. J. (1999). A practical R & D project-selection scoring tool. Engineering Management, IEEE Transactions on, 46(2), 158-170.
Kirkpatrick, S. (1984). Optimization by simulated annealing: Quantitative studies. Journal of statistical physics, 34(5-6), 975-986.
Kolahan, F., & Liang, M. (1998). An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups. European Journal of Operational Research, 109(1), 142-159.
Kyparisis, J., & Douligeris, C. (1993). Single machine scheduling and selection to minimize total flow time with minimum number tardy. Journal of the Operational Research Society, 44(8), 835-838.
Lessmann, S., Caserta, M., & Arango, I. M. (2011). Tuning metaheuristics: A data mining based approach for particle swarm optimization. Expert Systems with Applications, 38(10), 12826-12838.
Low, C., Hsu, C. J., & Su, C. T. (2008). Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Computers & Mathematics with Applications, 56(1), 257-265.
Luo, X., & Chu, C. (2007). A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness. European Journal of Operational Research, 180(1), 68-81.
Meade, L. M., & Presley, A. (2002). R & D project selection using the analytic network process. Engineering Management, IEEE Transactions on, 49(1), 59-66.
Mart?, R., Laguna, M., & Glover, F. (2006). Principles of scatter search. European Journal of Operational Research, 169(2), 359-372.
Mart?, R. (2006). Scatter search—wellsprings and challenges. European Journal of Operational Research, 169(2), 351-358.
Montgomery, D. C. (2012). Design and Analysis of Experiments, 8th Edition: John Wiley & Sons, Hoboken, NJ.
Mosavi, M. R., & Shiroie, M. (2012). Efficient evolutionary algorithms for GPS satellites classification. Arabian Journal for Science and Engineering, 37(7), 2003-2015.
Sioud, A., Gravel, M., & Gagné, C. (2012). A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. Computers & Operations Research, 39(10), 2415-2424.
Shingo, S. (1989). A study of the Toyota production system: From an Industrial Engineering Viewpoint. Productivity Press.
Yavuz, S., & Captain, T. A. (2002). Making project selection decisions: a multi-period capital budgeting problem. International Journal of Industrial Engineering, 9(3), 301-310.
Akbaripour, H., & Masehian, E. (2013). Efficient and robust parameter tuning for heuristic algorithms. International Journal of Industrial Engineering & Production Research, 24(2), 143-150.
Allahverdi, A., Ng, C. T., Cheng, T. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985-1032.
Arif, S., Mohammedi, R. D., Hellal, A., & Choucha, A. (2012). A memory simulated annealing method to the unit commitment problem with ramp constraints. Arabian Journal for Science and Engineering, 37(4), 1021-1031.
Baker, K.R. (1974). Introduction to Sequencing and Scheduling. Wiley, NY.
Behnamian, J., & Zandieh, M. (2013). Earliness and tardiness minimizing on a realistic hybrid flowshop scheduling with learning effect by advanced metaheuristic. Arabian Journal for Science and Engineering, 38(5), 1229-1242.
Chen, J. S., Liu, H. S., & Nien, H. Y. (2007). Minimizing makespan in single machine scheduling with job deliveries to one customer area. International Journal of Industiral Engineering-Theory and Applilcations and Practice, 14(2), 203-211.
Chen, S. M., & Chien, C. Y. (2011). Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Systems with Applications, 38(12), 14439-14450.
Conway, R. W., Maxwell, W. L., & Miller, L. W. (2012). Theory of scheduling. Courier Corporation.
Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483-495.
Emmons, H. (1975). One machine sequencing to minimize mean flow time with minimum number tardy. Naval Research Logistics Quarterly, 22(3), 585-592.
Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156-166.
Glover, F. (1994). Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Applied Mathematics, 49(1), 231-255.
Henriksen, A. D., & Traynor, A. J. (1999). A practical R & D project-selection scoring tool. Engineering Management, IEEE Transactions on, 46(2), 158-170.
Kirkpatrick, S. (1984). Optimization by simulated annealing: Quantitative studies. Journal of statistical physics, 34(5-6), 975-986.
Kolahan, F., & Liang, M. (1998). An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups. European Journal of Operational Research, 109(1), 142-159.
Kyparisis, J., & Douligeris, C. (1993). Single machine scheduling and selection to minimize total flow time with minimum number tardy. Journal of the Operational Research Society, 44(8), 835-838.
Lessmann, S., Caserta, M., & Arango, I. M. (2011). Tuning metaheuristics: A data mining based approach for particle swarm optimization. Expert Systems with Applications, 38(10), 12826-12838.
Low, C., Hsu, C. J., & Su, C. T. (2008). Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Computers & Mathematics with Applications, 56(1), 257-265.
Luo, X., & Chu, C. (2007). A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness. European Journal of Operational Research, 180(1), 68-81.
Meade, L. M., & Presley, A. (2002). R & D project selection using the analytic network process. Engineering Management, IEEE Transactions on, 49(1), 59-66.
Mart?, R., Laguna, M., & Glover, F. (2006). Principles of scatter search. European Journal of Operational Research, 169(2), 359-372.
Mart?, R. (2006). Scatter search—wellsprings and challenges. European Journal of Operational Research, 169(2), 351-358.
Montgomery, D. C. (2012). Design and Analysis of Experiments, 8th Edition: John Wiley & Sons, Hoboken, NJ.
Mosavi, M. R., & Shiroie, M. (2012). Efficient evolutionary algorithms for GPS satellites classification. Arabian Journal for Science and Engineering, 37(7), 2003-2015.
Sioud, A., Gravel, M., & Gagné, C. (2012). A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. Computers & Operations Research, 39(10), 2415-2424.
Shingo, S. (1989). A study of the Toyota production system: From an Industrial Engineering Viewpoint. Productivity Press.
Yavuz, S., & Captain, T. A. (2002). Making project selection decisions: a multi-period capital budgeting problem. International Journal of Industrial Engineering, 9(3), 301-310.