A new neighbourhood structure for job shop scheduling problems

References

• Abedi, M., R. Chiong, N. Noman, and R. Zhang. 2020. “A Multi-Population, Multi-Objective Memetic Algorithm for Energy-Efficient Job-Shop Scheduling with Deteriorating Machines.” Expert Systems with Applications 157: 113348.
   Web of Science ®Google Scholar
• Adams, J., E. Balas, and D. Zawack. 1988. “The Shifting Bottleneck Procedure for Job Shop Scheduling.” Management Science 34 (3): 391–401.
   Web of Science ®Google Scholar
• Ahmadian, M. M., A. Salehipour, and T. C. E. Cheng. 2020. “A Meta-Heuristic to Solve the Just-in-Time Job-Shop Scheduling Problem.” European Journal of Operational Research 288 (1): 14–29.
   Web of Science ®Google Scholar
• Applegate, D., and W. Cook. 1991. “A Computational Study of the Job-Shop Scheduling Problem.” ORSA Journal on Computing 3 (2): 149–156.
   Google Scholar
• Balas, E. 1969. “Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm.” Operations Research 17 (6): 941–957.
   Web of Science ®Google Scholar
• Balas, E., and A. Vazacopoulos. 1998. “Guided Local Search with Shifting Bottleneck for Job Shop Scheduling.” Management Science 44 (2): 262–275.
   Web of Science ®Google Scholar
• Caldeira, R. H., and A. Gnanavelbabu. 2019. “Solving the Flexible Job Shop Scheduling Problem Using an Improved Jaya Algorithm.” Computers & Industrial Engineering 137: 106064.
   Web of Science ®Google Scholar
• Cheng, T. C. E., B. Peng, and Z. Lü. 2016. “A Hybrid Evolutionary Algorithm to Solve the Job Shop Scheduling Problem.” Annals of Operations Research 242 (2): 223–237.
   Web of Science ®Google Scholar
• Dao, T. K., T. S. Pan, and J. S. Pan. 2018. “Parallel Bat Algorithm for Optimizing Makespan in Job Shop Scheduling Problems.” Journal of Intelligent Manufacturing 29 (2): 451–462.
   Web of Science ®Google Scholar
• Fisher, H., and G. L. Thompson. 1963. “Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules.” In Industrial Scheduling, 225–251. Englewood Cliffs, NJ: Prentice-Hall.
   Google Scholar
• Gong, G., R. Chiong, Q. Deng, and X. Gong. 2020a. “A Hybrid Artificial Bee Colony Algorithm for Flexible Job Shop Scheduling with Worker Flexibility.” International Journal of Production Research 58 (14): 4406–4420.
   Web of Science ®Google Scholar
• Gong, G., R. Chiong, Q. Deng, W. Han, L. Zhang, W. Lin, and K. Li. 2020b. “Energy-Efficient Flexible Flow Shop Scheduling with Worker Flexibility.” Expert Systems with Applications 141: 112902.
   Web of Science ®Google Scholar
• Kellerer, H., K. Rustogi, and V. A. Strusevich. 2020. “A Fast FPTAS for Single Machine Scheduling Problem of Minimizing Total Weighted Earliness and Tardiness About a Large Common Due Date.” Omega 90: 101992.
   Web of Science ®Google Scholar
• Kurdi, M. 2017. “An Improved Island Model Memetic Algorithm with a New Cooperation Phase for Multi-Objective Job Shop Scheduling Problem.” Computers & Industrial Engineering 111: 183–201.
   Web of Science ®Google Scholar
• Lawrence, S. 1984. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. Pittsburgh, PA: Graduate School of Industrial Administration, Carnegie-Mellon University.
   Google Scholar
• Lenstra, J. K., A. R. Kan, and P. Brucker. 1977. “Complexity of Machine Scheduling Problems.” Annals of Discrete Mathematics 1: 343–362.
   Google Scholar
• Li, J. Q., Q. K. Pan, and J. Chen. 2012. “A Hybrid Pareto-Based Local Search Algorithm for Multi-Objective Flexible Job Shop Scheduling Problems.” International Journal of Production Research 50 (4): 1063–1078.
   Web of Science ®Google Scholar
• Nagata, Y., and I. Ono. 2018. “A Guided Local Search with Iterative Ejections of Bottleneck Operations for the Job Shop Scheduling Problem.” Computers & Operations Research 90: 60–71.
   Web of Science ®Google Scholar
• Nowicki, E., and C. Smutnicki. 1996. “A Fast Taboo Search Algorithm for the Job Shop Problem.” Management Science 42 (6): 797–813.
   Web of Science ®Google Scholar
• Nowicki, E., and C. Smutnicki. 2002. Some New Tools to Solve the Job Shop Problem. Technical Report 60/2002. Wroclaw, Poland: Institute of Engineering Cybernetics, Technical University of Wroclaw.
   Google Scholar
• Nowicki, E., and C. Smutnicki. 2005. “An Advanced Tabu Search Algorithm for the Job Shop Problem.” Journal of Scheduling 8 (2): 145–159.
   Web of Science ®Google Scholar
• Peng, B., Z. Lü, and T. E. C. Cheng. 2015. “A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem.” Computers & Operations Research 53: 154–164.
   Web of Science ®Google Scholar
• Qin, H., P. Fan, H. Tang, P. Huang, B. Fang, and S. Pan. 2019. “An Effective Hybrid Discrete Grey Wolf Optimizer for the Casting Production Scheduling Problem with Multi-Objective and Multi-Constraint.” Computers & Industrial Engineering 128: 458–476.
   Web of Science ®Google Scholar
• Storer, R. H., S. D. Wu, and R. Vaccari. 1992. “New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling.” Management Science 38 (10): 1495–1509.
   Web of Science ®Google Scholar
• Taillard, E. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64 (2): 278–285.
   Web of Science ®Google Scholar
• Taillard, E. D. 1994. “Parallel Taboo Search Techniques for the Job Shop Scheduling Problem.” ORSA Journal on Computing 6 (2): 108–117.
   Google Scholar
• Tang, H., R. Chen, Y. Li, Z. Peng, S. Guo, and Y. Du. 2019. “Flexible Job-Shop Scheduling with Tolerated Time Interval and Limited Starting Time Interval Based on Hybrid Discrete PSO-SA: An Application from a Casting Workshop.” Applied Soft Computing 78: 176–194.
   Web of Science ®Google Scholar
• Ten Eikelder, H. M. M., B. J. M. Aarts, M. G. A. Verhoeven, and E. H. L. Aarts. 1999. “Sequential and Paralled Local Search Algorithms for Job Shop Scheduling.” In Meta-Heuristic: Advances and Trends in Local Search Paradigms for Optimization, edited by S. Voss, S. Martello, I. H. Osman, and C. Roucairol, 359–371. Massachusetts: Kluwer Academic Publishers.
   Google Scholar
• Zhang, C., P. Li, Z. Guan, and Y. Rao. 2007. “A Tabu Search Algorithm with a New Neighborhood Structure for the Job Shop Scheduling Problem.” Computers & Operations Research 34 (11): 3229–3242.
   Web of Science ®Google Scholar
• Zhao, F., X. He, and L. Wang. 2020. “A Two-Stage Cooperative Evolutionary Algorithm with Problem-Specific Knowledge for Energy-Efficient Scheduling of No-Wait Flow-Shop Problem.” IEEE Transactions on Cybernetics 51 (11): 5291–5303.
   Web of Science ®Google Scholar
• Zhao, F., R. Ma, and L. Wang. 2021. “A Self-Learning Discrete Jaya Algorithm for Multiobjective Energy-Efficient Distributed No-Idle Flow-Shop Scheduling Problem in Heterogeneous Factory System.” IEEE Transactions on Cybernetics. doi:10.1109/TCYB.2021.3086181.
   Web of Science ®Google Scholar
• Zheng, X., S. Zhou, R. Xu, and H. Chen. 2020. “Energy-Efficient Scheduling for Multi-Objective Two-Stage Flow Shop Using a Hybrid Ant Colony Optimisation Algorithm.” International Journal of Production Research 58 (13): 4103–4120.
   Web of Science ®Google Scholar
• Zhou, S., L. Xing, X. Zheng, N. Du, L. Wang, and Q. Zhang. 2019. “A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine with Arbitrary Job Sizes and Release Times.” IEEE Transactions on Cybernetics 51 (3): 1430–1442.
   Web of Science ®Google Scholar