Parallel machine scheduling with step-deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm

References

• Alidaee, B., and N. K. Womer. 1999. “Scheduling with Time Dependent Processing Times: Review and Extensions.” Journal of the Operational Research Society 50 (7): 711–720. doi: 10.1057/palgrave.jors.2600740
   Web of Science ®Google Scholar
• Allahverdi, A., J. N. D. Gupta, and T. Aldowaisan. 1999. “A Review of Scheduling Research Involving Setup Considerations.” Omega 27 (2): 219–239. doi: 10.1016/S0305-0483(98)00042-5
   Web of Science ®Google Scholar
• Allahverdi, A., C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times or Costs.” European Journal of Operational Research 187 (3): 985–1032. doi: 10.1016/j.ejor.2006.06.060
   Web of Science ®Google Scholar
• Armentano, V. A., and M. F. De Franca Filho. 2007. “Minimizing Total Tardiness in Parallel Machine Scheduling with Setup Times: An Adaptive Memory-Based GRASP Approach.” European Journal of Operational Research 183 (1): 100–114. doi: 10.1016/j.ejor.2006.09.077
   Web of Science ®Google Scholar
• Bahalke, U., A. M. Yolmeh, and K. Shahanaghi. 2010. “Meta-Heuristics to Solve Single-Machine Scheduling Problem with Sequence-Dependent Setup Time and Deteriorating Jobs.” International Journal of Advanced Manufacturing Technology 50 (5-8): 749–759. doi: 10.1007/s00170-010-2526-5
   Web of Science ®Google Scholar
• Bank, M., S. M. T. Fatemi Ghomi, F. Jolai, and J. Behnamian. 2012. “Application of Particle Swarm Optimization and Simulated Annealing Algorithms in Flow Shop Scheduling Problem under Linear Deterioration.” Advances in Engineering Software 47 (1): 1–6. doi: 10.1016/j.advengsoft.2011.12.001
   Web of Science ®Google Scholar
• Biskup, D., J. Herrmann, and J. N. D. Gupta. 2008. “Scheduling Identical Parallel Machines to Minimize Total Tardiness.” International Journal of Production Economics 115 (1): 134–142. doi: 10.1016/j.ijpe.2008.04.011
   Web of Science ®Google Scholar
• Browne, S., and U. Yechiali. 1990. “Scheduling Deteriorating Jobs on a Single Processor.” Operations Research 38 (3): 495–498. doi: 10.1287/opre.38.3.495
   Web of Science ®Google Scholar
• Burnwal, S., and S. Deb. 2013. “Scheduling Optimization of Flexible Manufacturing System Using Cuckoo Search-Based Approach.” International Journal of Advanced Manufacturing Technology 64 (5-8): 951–959. doi: 10.1007/s00170-012-4061-z
   Web of Science ®Google Scholar
• Cheng, T. C. E., and Q. Ding. 2001. “Single Machine Scheduling with Step-Deteriorating Processing Times.” European Journal of Operational Research 134 (3): 623–630. doi: 10.1016/S0377-2217(00)00284-8
   Web of Science ®Google Scholar
• Cheng, T. C. E., Q. Ding, M. Y. Kovalyov, A. Bachman, and A. Janiak. 2003. “Scheduling Jobs with Piecewise Linear Decreasing Processing Times.” Naval Research Logistics 50 (6): 531–554. doi: 10.1002/nav.10073
   Web of Science ®Google Scholar
• Cheng, T. C. E., Q. Ding, and B. M. T. Lin. 2004. “A Concise Survey of Scheduling with Time-Dependent Processing Times.” European Journal of Operational Research 152 (1): 1–13. doi: 10.1016/S0377-2217(02)00909-8
   Web of Science ®Google Scholar
• Cheng, W. M., P. Guo, Z. Q. Zhang, M. Zeng, and J. Liang. 2012. “Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs.” Mathematical Problems in Engineering, Article ID 928312. http://dx.doi.org/10.1155/2012/928312.
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. J. Hsu, Y. C. Huang, and W. C. Lee. 2011. “Single-Machine Scheduling with Deteriorating Jobs and Setup Times to Minimize the Maximum Tardiness.” Computers & Operations Research 38 (12): 1760–1765. doi: 10.1016/j.cor.2010.11.014
   Web of Science ®Google Scholar
• Cheng, T. C. E., W. C. Lee, and C. C. Wu. 2011. “Single-Machine Scheduling with Deteriorating Jobs and Past-Sequence-Dependent Setup Times.” Applied Mathematical Modelling 35 (4): 1861–1867. doi: 10.1016/j.apm.2010.10.015
   Web of Science ®Google Scholar
• Chung, Tsui-Ping, Ching-Jong Liao, and Milton Smith. 2014. “A Canned Food Scheduling Problem with Batch Due Date.” Engineering Optimization 46 (9): 1284–1294. doi: 10.1080/0305215X.2013.827674
   Web of Science ®Google Scholar
• Civicioglu, Pinar. 2012. “Transforming Geocentric Cartesian Coordinates to Geodetic Coordinates by Using Differential Search Algorithm.” Computers & Geosciences 46 (Sep.): 229–247. doi: 10.1016/j.cageo.2011.12.011
   Web of Science ®Google Scholar
• Civicioglu, Pinar. 2013. “Backtracking Search Optimization Algorithm for Numerical Optimization Problems.” Applied Mathematics and Computation 219 (15): 8121–8144. doi: 10.1016/j.amc.2013.02.017
   Web of Science ®Google Scholar
• Civicioglu, P., and E. Besdok. 2013. “A Conceptual Comparison of the Cuckoo-Search, Particle Swarm Optimization, Differential Evolution and Artificial Bee Colony Algorithms.” Artificial Intelligence Review 39 (4): 315–346. doi: 10.1007/s10462-011-9276-0
   Web of Science ®Google Scholar
• Davis, L. 1985. “Applying Adaptive Algorithms to Epistatic Domains.” In Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, CA, 162–164. San Francisco, CA: Morgan Kaufmann.
   Google Scholar
• Farahani, M. H., and L. Hosseini. 2013. “Minimizing Cycle Time in Single Machine Scheduling with Start Time-Dependent Processing Times.” International Journal of Advanced Manufacturing Technology 64 (9-12): 1479–1486. doi: 10.1007/s00170-012-4116-1
   Web of Science ®Google Scholar
• Gandomi, A. H., X. S. Yang, and A. H. Alavi. 2013. “Cuckoo Search Algorithm: A Metaheuristic Approach to Solve Structural Optimization Problems.” Engineering with Computers 29 (1): 17–35. doi: 10.1007/s00366-011-0241-y
   Web of Science ®Google Scholar
• Gawiejnowicz, S. 2008. Time-Dependent Scheduling. Berlin: Springer.
   Google Scholar
• Guo, P., W. M. Cheng, and Y. Wang. 2014. “A General Variable Neighborhood Search for Single-Machine Total Tardiness Scheduling Problem with Step-Deteriorating Jobs.” Journal of Industrial and Management Optimization 10 (4): 1071–1090. doi: 10.3934/jimo.2014.10.1071
   Web of Science ®Google Scholar
• Gupta, J. N. D., and S. K. Gupta. 1988. “Single Facility Scheduling with Nonlinear Processing Times.” Computers & Industrial Engineering 14 (4): 387–393. doi: 10.1016/0360-8352(88)90041-1
   Web of Science ®Google Scholar
• He, C. C., C. C. Wu, and W. C. Lee. 2009. “Branch-and-Bound and Weight-Combination Search Algorithms for the Total Completion Time Problem with Step-Deteriorating Jobs.” Journal of the Operational Research Society 60 (12): 1759–1766. doi: 10.1057/jors.2008.123
   Web of Science ®Google Scholar
• Huang, X., and M. Z. Wang. 2011. “Parallel Identical Machines Scheduling with Deteriorating Jobs and Total Absolute Differences Penalties.” Applied Mathematical Modelling 35 (3): 1349–1353. doi: 10.1016/j.apm.2010.09.013
   Web of Science ®Google Scholar
• Jafari, A., and G. Moslehi. 2012. “Scheduling Linear Deteriorating Jobs to Minimize the Number of Tardy Jobs.” Journal of Global Optimization 54 (2): 389–404. doi: 10.1007/s10898-011-9767-1
   Web of Science ®Google Scholar
• Jeng, A. A. K., and B. M. T. Lin. 2004. “Makespan Minimization in Single-Machine Scheduling with Step-Deterioration of Processing Times.” Journal of the Operational Research Society 55 (3): 247–256. doi: 10.1057/palgrave.jors.2601693
   Web of Science ®Google Scholar
• Jeng, A. A. K., and B. M. T. Lin. 2005. “Minimizing the Total Completion Time in Single-Machine Scheduling with Step-Deteriorating Jobs.” Computers & Operations Research 32 (3): 521–536. doi: 10.1016/j.cor.2003.08.001
   Web of Science ®Google Scholar
• Ji, M., and T. C. E. Cheng. 2007. “An FPTAS for Scheduling Jobs with Piecewise Linear Decreasing Processing Times to Minimize Makespan.” Information Processing Letters 102 (2-3): 41–47. doi: 10.1016/j.ipl.2006.11.014
   Web of Science ®Google Scholar
• Joo, Cheol Min, and Byung Soo Kim. 2012. “Parallel Machine Scheduling Problem with Ready Times, Due Times and Sequence-Dependent Setup Times Using Meta-Heuristic Algorithms.” Engineering Optimization 44 (9): 1021–1034. doi: 10.1080/0305215X.2011.628388
   Web of Science ®Google Scholar
• Kanagaraj, G., S. G. Ponnambalam, N. Jawahar, and J. Mukund Nilakantan. 2013. “An Effective Hybrid Cuckoo Search and Genetic Algorithm for Constrained Engineering Design Optimization.” Engineering Optimization 46 (10): 1331–1351. http://dx.doi.org/10.1080/0305215X.2013.836640. doi: 10.1080/0305215X.2013.836640
   Web of Science ®Google Scholar
• Kaplan, Sezgin, and Ghaith Rabadi. 2013. “Simulated Annealing and Metaheuristic for Randomized Priority Search Algorithms for the Aerial Refuelling Parallel Machine Scheduling Problem with Due Date-to-Deadline Windows and Release Times.” Engineering Optimization 45 (1): 67–87. doi: 10.1080/0305215X.2012.658783
   Web of Science ®Google Scholar
• Kubiak, W., and S. Van de Velde. 1998. “Scheduling Deteriorating Jobs to Minimize Makespan.” Naval Research Logistics 45 (5): 511–523. doi: 10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6
   Web of Science ®Google Scholar
• Kunnathur, A. S., and S. K. Gupta. 1990. “Minimizing the Makespan with Late Start Penalties Added to Processing Times in a Single Facility Scheduling Problem.” European Journal of Operational Research 47 (1): 56–64. doi: 10.1016/0377-2217(90)90089-T
   Web of Science ®Google Scholar
• Lai, P. J., W. C. Lee, and H. H. Chen. 2011. “Scheduling with Deteriorating Jobs and Past-Sequence-Dependent Setup Times.” International Journal of Advanced Manufacturing Technology 54 (5-8): 737–741. doi: 10.1007/s00170-010-2949-z
   Web of Science ®Google Scholar
• Layegh, J., F. Jolai, and M. S. Amalnik. 2009. “A Memetic Algorithm for Minimizing the Total Weighted Completion Time on a Single Machine Under Step-Deterioration.” Advances in Engineering Software 40 (10): 1074–1077. doi: 10.1016/j.advengsoft.2009.03.018
   Web of Science ®Google Scholar
• Lee, W. C., J. B. Lin, and Y. R. Shiau. 2011. “Deteriorating Job Scheduling to Minimize the Number of Late Jobs with Setup Times.” Computers & Industrial Engineering 61 (3): 782–787. doi: 10.1016/j.cie.2011.05.010
   Web of Science ®Google Scholar
• Lee, Hsin-Tao, Dar-Li Yang, and Suh-Jenq Yang. 2013. “Multi-Machine Scheduling with Deterioration Effects and Maintenance Activities for Minimizing the Total Earliness and Tardiness Costs.” International Journal of Advanced Manufacturing Technology 66 (1-4): 547–554. doi: 10.1007/s00170-012-4348-0
   Web of Science ®Google Scholar
• Leung, J. Y. T., C. T. Ng, and T. C. E. Cheng. 2008. “Minimizing Sum of Completion Times for Batch Scheduling of Jobs with Deteriorating Processing Times.” European Journal of Operational Research 187 (3): 1090–1099. doi: 10.1016/j.ejor.2006.03.067
   Web of Science ®Google Scholar
• Li, X. T., and M. H. Yin. 2013. “A Hybrid Cuckoo Search via Lévy Flights for the Permutation Flow Shop Scheduling Problem.” International Journal of Production Research 51 (16): 4732–4754. doi: 10.1080/00207543.2013.767988
   Web of Science ®Google Scholar
• Mor, B., and G. Mosheiov. 2012. “Batch Scheduling with Step-Deteriorating Processing Times to Minimize Flowtime.” Naval Research Logistics 59 (8): 587–600. doi: 10.1002/nav.21508
   Web of Science ®Google Scholar
• Mosheiov, G. 1995. “Scheduling Jobs with Step-Deterioration; Minimizing Makespan on a Single- and Multi-Machine.” Computers & Industrial Engineering 28 (4): 869–879. doi: 10.1016/0360-8352(95)00006-M
   Web of Science ®Google Scholar
• Moslehi, G., and A. Jafari. 2010. “Minimizing the Number of Tardy Jobs under Piecewise-Linear Deterioration.” Computers & Industrial Engineering 59 (4): 573–584. doi: 10.1016/j.cie.2010.06.017
   Web of Science ®Google Scholar
• Ouaarab, A., B. Ahiod, and X. S. Yang. Online First 2013. “Discrete Cuckoo Search Algorithm for the Travelling Salesman Problem.” Neural Computing and Applications 24 (7–8): 1659–1669. doi: 10.1007/s00521-013-1402-2
   Web of Science ®Google Scholar
• Radhakrishnan, S., and J. A. Ventura. 2000. “Simulated Annealing for Parallel Machine Scheduling with Earliness–Tardiness Penalties and Sequence-Dependent Set-Up Times.” International Journal of Production Research 38 (10): 2233–2252. doi: 10.1080/00207540050028070
   Web of Science ®Google Scholar
• Ruiz, R., C. Maroto, and J. Alcaraz. 2006. “Two New Robust Genetic Algorithms for the Flowshop Scheduling Problem.” Omega 34 (5): 461–476. doi: 10.1016/j.omega.2004.12.006
   Web of Science ®Google Scholar
• Sundararaghavan, P. S., and A. S. Kunnathur. 1994. “Single Machine Scheduling with Start Time Dependent Processing Times: Some Solvable Cases.” European Journal of Operational Research 78 (3): 394–403. doi: 10.1016/0377-2217(94)90048-5
   Web of Science ®Google Scholar
• Toksari, M. D., and E. Guener. 2008. “Minimizing the Earliness/Tardiness Costs on Parallel Machine with Learning Effects and Deteriorating Jobs: A Mixed Nonlinear Integer Programming Approach.” International Journal of Advanced Manufacturing Technology 38 (7-8): 801–808. doi: 10.1007/s00170-007-1128-3
   Web of Science ®Google Scholar
• Valian, E., S. Tavakoli, S. Mohanna, and A. Haghi. 2013. “Improved Cuckoo Search for Reliability Optimization Problems.” Computers & Industrial Engineering 64 (1): 459–468. doi: 10.1016/j.cie.2012.07.011
   Web of Science ®Google Scholar
• Valian, Ehsan, and Elham Valian. 2013. “A Cuckoo Search Algorithm by Lévy Flights for Solving Reliability Redundancy Allocation Problems.” Engineering Optimization 45 (11): 1273–1286. doi: 10.1080/0305215X.2012.729055
   Web of Science ®Google Scholar
• Walton, S., O. Hassan, K. Morgan, and M. R. Brown. 2011. “Modified Cuckoo Search: A New Gradient Free Optimisation Algorithm.” Chaos, Solitons & Fractals 44 (9): 710–718. doi: 10.1016/j.chaos.2011.06.004
   Web of Science ®Google Scholar
• Wang, J. B., Y. Jiang, and G. Wang. 2009. “Single-Machine Scheduling with Past-Sequence-Dependent Setup Times and Effects of Deterioration and Learning.” International Journal of Advanced Manufacturing Technology 41 (11-12): 1221–1226. doi: 10.1007/s00170-008-1512-7
   Web of Science ®Google Scholar
• Wu, C. C., Y. R. Shiau, L. H. Lee, and W. C. Lee. 2009. “Scheduling Deteriorating Jobs to Minimize the Makespan on a Single Machine.” International Journal of Advanced Manufacturing Technology 44 (11-12): 1230–1236. doi: 10.1007/s00170-008-1924-4
   Web of Science ®Google Scholar
• Yang, Suh-Jenq. 2013. “Unrelated Parallel-Machine Scheduling with Deterioration Effects and Deteriorating Multi-Maintenance Activities for Minimizing the Total Completion Time.” Applied Mathematical Modelling 37 (5): 2995–3005. doi: 10.1016/j.apm.2012.07.029
   Web of Science ®Google Scholar
• Yang, X. S., and S. Deb. 2009. “Cuckoo Search via Lévy Flights.” In Proceedings of the World Congress on Nature and Biologically Inspired Computing, 210–214. IEEE Coimbatore, India: IEEE Publications.
   Google Scholar
• Yang, X. S., and S. Deb. 2010. “Engineering Optimisation by Cuckoo Search.” International Journal of Mathematical Modelling and Numerical Optimisation 1 (4): 330–343. doi: 10.1504/IJMMNO.2010.035430
   Google Scholar
• Yildiz, A. R. 2013. “Cuckoo Search Algorithm for the Selection of Optimal Machining Parameters in Milling Operations.” International Journal of Advanced Manufacturing Technology 64 (1-4): 55–61. doi: 10.1007/s00170-012-4013-7
   Web of Science ®Google Scholar
• Yin, Y. Q., T. C. E. Cheng, J. Y. Xu, S. R. Cheng, and C. C. Wu. 2013. “Single-Machine Scheduling with Past-Sequence-Dependent Delivery Times and a Linear Deterioration.” Journal of Industrial and Management Optimization 9 (2): 323–339.
   Web of Science ®Google Scholar
• Zhao, C. L., and H. Y. Tang. 2010. “Single Machine Scheduling with Past-Sequence-Dependent Setup Times and Deteriorating Jobs.” Computers & Industrial Engineering 59 (4): 663–666. doi: 10.1016/j.cie.2010.07.015
   Web of Science ®Google Scholar