A multi-agent resource bidding algorithm for order acceptance and assembly job shop scheduling

References

• Adhau, S., M. L. Mittal, and A. Mittal. 2012. “A Multi-Agent System for Distributed Multi-Project Scheduling: An Auction-Based Negotiation Approach.” Engineering Applications of Artificial Intelligence 25 (8): 1738–1751. https://doi.org/10.1016/j.engappai.2011.12.003.
   Web of Science ®Google Scholar
• Ahmadian, M., A. Salehipour, and E. T. Cheng. 2021. “A Meta-Heuristic to Solve the Just-in-Time job-Shop Scheduling Problem.” European Journal of Operational Research 288 (1): 14–29. https://doi.org/10.1016/j.ejor.2020.04.017.
   Web of Science ®Google Scholar
• Antons, O., and J. C. Arlinghaus. 2022. “Data-driven and Autonomous Manufacturing Control in Cyber-Physical Production Systems.” Computers in Industry 141: 103711. https://doi.org/10.1016/j.compind.2022.103711.
   Web of Science ®Google Scholar
• Artigues, C. 2017. “On the Strength of Time-Indexed Formulations for the Resource-Constrained Project Scheduling Problem.” Operations Research Letters 45 (2): 154–159. https://doi.org/10.1016/j.orl.2017.02.001.
   Web of Science ®Google Scholar
• Asadzadeh, L., and K. Zamanifar. 2010. “An Agent-Based Parallel Approach for the Job Shop Scheduling Problem with Genetic Algorithms.” Mathematical and Computer Modelling 52 (11-12): 1957–1965. https://doi.org/10.1016/j.mcm.2010.04.019.
   Google Scholar
• Bansal, A., R. Uzsoy, and K. Kempf. 2020. “Iterative Combinatorial Auctions for Managing Product Transitions in Semiconductor Manufacturing.” IISE Transactions 52 (4): 413–431. https://doi.org/10.1080/24725854.2019.1651951.
   Web of Science ®Google Scholar
• Baptiste, P., M. Flamini, and F. Sourd. 2008. “Lagrangian Bounds for Just-in-Time job-Shop Scheduling.” Computers & Operations Research 35 (3): 906–915. https://doi.org/10.1016/j.cor.2006.05.009.
   Web of Science ®Google Scholar
• Ben-Daya, M., E. Hassini, and Z. Bahroun. 2019. “Internet of Things and Supply Chain Management: A Literature Review.” International Journal of Production Research 57 (15-16): 4719–4742. https://doi.org/10.1080/00207543.2017.1402140.
   Web of Science ®Google Scholar
• Beşikci, U., Ü Bilge, and G. Ulusoy. 2015. “Multi-mode Resource Constrained Multi-Project Scheduling and Resource Portfolio Problem.” European Journal of Operational Research 240 (1): 22–31. https://doi.org/10.1016/j.ejor.2014.06.025.
   Web of Science ®Google Scholar
• Bierwirth, C., and D. C. Mattfeld. 1999. “Production Scheduling and Rescheduling with Genetic Algorithms.” Evolutionary Computation 7 (1): 1–17. https://doi.org/10.1162/evco.1999.7.1.1.
   PubMed Web of Science ®Google Scholar
• Çaliş, B., and S. Bulkan. 2013. “A Research Survey: Review of AI Solution Strategies of Job Shop Scheduling Problem.” Journal of Intelligent Manufacturing 26 (5): 961–973. https://doi.org/10.1007/s10845-013-0837-8.
   Web of Science ®Google Scholar
• Carr, S., and I. Duenyas. 2000. “Optimal Admission Control and Sequencing in a Make-to-Stock/Make-to-Order Production System.” Operations Research 48 (5): 709–720. https://doi.org/10.1287/opre.48.5.709.12401.
   Web of Science ®Google Scholar
• Cha, Y., and M. Jung. 2003. “Satisfaction Assessment of Multi-Objective Schedules Using Neural Fuzzy Methodology.” International Journal of Production Research 41 (8): 1831–1849. https://doi.org/10.1080/1352816031000074937.
   Web of Science ®Google Scholar
• Chang, S.-C., M.-M. Hsieh, and C.-W. Chen. 2007. “Reverse Auction-Based job Assignment among Foundry Fabs.” International Journal of Production Research: Recent Developments in Modelling and Analysis of Semiconductor Manufacturing 45 (3): 653–673.
   Web of Science ®Google Scholar
• Charnsirisakskul, K., P. M. Griffin, and P. Keskinocak. 2004. “Order Selection and Scheduling with Leadtime Flexibility.” IIE Transactions 36 (7): 697–707. https://doi.org/10.1080/07408170490447366.
   Web of Science ®Google Scholar
• Chen, J. C., Y.-Y. Chen, T.-L. Chen, and Y.-H. Lin. 2022. “Multi-project Scheduling with Multi-Skilled Workforce Assignment Considering Uncertainty and Learning Effect for Large-Scale Equipment Manufacturer.” Computers & Industrial Engineering 169: 108240. https://doi.org/10.1016/j.cie.2022.108240.
   Web of Science ®Google Scholar
• Chen, M., and Y. Dong. 1999. “Applications of Neural Networks to Solving SMT Scheduling Problems a Case Study.” International Journal of Production Research 37 (17): 4007–4020. https://doi.org/10.1080/002075499189899.
   Web of Science ®Google Scholar
• Chen, X., S. He, Y. Zhang, L. Tong, P. Shang, and X. Zhou. 2020. “Yard Crane and AGV Scheduling in Automated Container Terminal: A Multi-Robot Task Allocation Framework.” Transportation Research Part C 114: 241–271. https://doi.org/10.1016/j.trc.2020.02.012.
   Web of Science ®Google Scholar
• Chen, H., and P. B. Luh. 2003. “An Alternative Framework to Lagrangian Relaxation Approach for Job Shop Scheduling.” European Journal of Operational Research 149 (3): 499–512. https://doi.org/10.1016/S0377-2217(02)00470-8.
   Web of Science ®Google Scholar
• Chong, P., G. Wu, T. W. Liao, and H. Wang. 2019. “Research on Multi-Agent Genetic Algorithm Based on Tabu Search for the Job Shop Scheduling Problem.” PLoS One 14 (9): 1–19.
   Web of Science ®Google Scholar
• Chun, H. W., and R. Y. Wong. 2003. “N∗—an Agent-Based Negotiation Algorithm for Dynamic Scheduling and Rescheduling.” Advanced Engineering Informatics 17 (1): 1–22. https://doi.org/10.1016/S1474-0346(03)00019-3.
   Web of Science ®Google Scholar
• Cramton, P. C., Y. Shoham, and R. Steinberg, Eds. 2006. Combinatorial Auctions. Cambridge, MA: MIT Press.
   Google Scholar
• Cummings, D. H., and M. P. Egbelu. 1998. “Minimizing Production Flow Time in a Process and Assembly Job Shop.” International Journal of Production Research 36 (8): 2315–2332. https://doi.org/10.1080/002075498192922.
   Web of Science ®Google Scholar
• Dabiri, M., M. Yazdani, B. Naderi, and H. Haleh. 2021. “Modeling and Solution Methods for Hybrid Flow Shop Scheduling Problem with Job Rejection.” Operational Research 22 (3): 2721–2765. https://doi.org/10.1007/s12351-021-00629-2.
   Web of Science ®Google Scholar
• Davis, R., and R. G. Smith. 1983. “Negotiation as a Metaphor for Distributed Problem Solving.” Artificial Intelligence 20 (1): 63–109. https://doi.org/10.1016/0004-3702(83)90015-2.
   Web of Science ®Google Scholar
• Dewan, P., and S. Joshi. 2001. “Implementation of an Auction-Based Distributed Scheduling Model for a Dynamic Job Shop Environment.” International Journal of Computer Integrated Manufacturing 14 (5): 446–456. https://doi.org/10.1080/09511920010022486.
   Web of Science ®Google Scholar
• Dewan, P., and S. Joshi. 2002. “Auction-based Distributed Scheduling in a Dynamic Job Shop Environment.” International Journal of Production Research 40 (5): 1173–1191. https://doi.org/10.1080/00207540110098445.
   Web of Science ®Google Scholar
• Doctor, S. R., T. M. Cavalier, and M. P. Egbelu. 1993. “Scheduling for Machining and Assembly in a Job-Shop Environment.” International Journal of Production Research 31 (6): 1275–1297. https://doi.org/10.1080/00207549308956791.
   Web of Science ®Google Scholar
• Duffie, N. A., and R. S. Piper. 1987. “Non-hierarchical Control of a Flexible Manufacturing Cell.” Robotics and Computer-Integrated Manufacturing 3 (2): 175–179. https://doi.org/10.1016/0736-5845(87)90099-8.
   Google Scholar
• Edis, E., C. Araz, and I. Ozkarahan. 2008. “Lagrangian-based Solution Approaches for a Resource-Constrained Parallel Machine Scheduling Problem with Machine Eligibility Restrictions.” In New Frontiers in Applied Artificial Intelligence, edited by N. Nguyen, L. Borzemski, A. Grzech, and M. Ali, 337–347. Berlin: Springer.
   Google Scholar
• Fisher, M. L. 1985. “An Applications Oriented Guide to Lagrangian Relaxation.” Interfaces 15 (2): 10–21. https://doi.org/10.1287/inte.15.2.10.
   Web of Science ®Google Scholar
• Goldberg, A. V., and R. E. Tarjan. 1988. “A new Approach to the Maximum-Flow Problem.” Journal of the ACM 35 (4): 921–940. https://doi.org/10.1145/48014.61051.
   Web of Science ®Google Scholar
• Gómez Urrutia, E. D., R. Aggoune, and S. Dauzère-Pérès. 2014. “Solving the Integrated lot-Sizing and job-Shop Scheduling Problem.” International Journal of Production Research 52 (17): 5236–5254. https://doi.org/10.1080/00207543.2014.902156.
   Web of Science ®Google Scholar
• Gordon, V. S., and V. A. Strusevich. 2009. “Single Machine Scheduling and Due Date Assignment with Positionally Dependent Processing Times.” European Journal of Operational Research 198 (1): 57–62. https://doi.org/10.1016/j.ejor.2008.07.044.
   Web of Science ®Google Scholar
• Grassi, A., G. Guizzi, L. C. Santillo, and S. Vespoli. 2021. “Assessing the Performances of a Novel Decentralised Scheduling Approach in Industry 4.0 and Cloud Manufacturing Contexts.” International Journal of Production Research 59 (20): 6034–6053. https://doi.org/10.1080/00207543.2020.1799105.
   Web of Science ®Google Scholar
• Guerrero, H. H., and G. M. Kern. 1988. “How to More Effectively Accept and Refuse Orders.” Production and Inventory Management Journal 29 (4): 59–63.
   Google Scholar
• Hajibabaei, M., and J. Behnamian. 2023. “Fuzzy Cleaner Production in Assembly Flexible Job-Shop Scheduling with Machine Breakdown and Batch Transportation: Lagrangian Relaxation.” Journal of Combinatorial Optimization 45 (112): 1–26.
   Google Scholar
• Haupt, R. 1989. “A Survey of Priority Rule-Based Scheduling.” Operations-Research-Spektrum 11 (1): 3–16. https://doi.org/10.1007/BF01721162.
   Google Scholar
• Held, M., P. Wolfe, and H. P. Crowder. 1974. “Validation of Subgradient Optimization.” Mathematical Programming 6 (1): 62–88. https://doi.org/10.1007/BF01580223.
   Google Scholar
• Holthaus, O., and C. Rajendran. 1997. “New Dispatching Rules for Scheduling in a Job Shop — An Experimental Study.” International Journal of Advanced Manufacturing Technology 13 (2): 148–153. https://doi.org/10.1007/BF01225761.
   Web of Science ®Google Scholar
• Huang, R.-H. 2010. “Multi-objective job-Shop Scheduling with Lot-Splitting Production.” International Journal of Production Economics 124 (1): 206–213. https://doi.org/10.1016/j.ijpe.2009.10.026.
   Web of Science ®Google Scholar
• Jain, A. S., and S. Meeran. 1999. “Deterministic job-Shop Scheduling: Past, Present and Future.” European Journal of Operational Research 113 (2): 390–434. https://doi.org/10.1016/S0377-2217(98)00113-1.
   Web of Science ®Google Scholar
• Jeong, I.-J., and S.-B. Yim. 2009. “A Job Shop Distributed Scheduling Based on Lagrangian Relaxation to Minimise Total Completion Time.” International Journal of Production Research 47 (24): 6783–6805. https://doi.org/10.1080/00207540701824217.
   Web of Science ®Google Scholar
• Jia, Z., X. Lu, J. Yang, and D. Jia. 2011. “Research on Job-Shop Scheduling Problem Based on Genetic Algorithm.” International Journal of Production Research 49 (12): 3585–3604. https://doi.org/10.1080/00207543.2010.481293.
   Web of Science ®Google Scholar
• Jolai, F., S. Sheikh, M. Rabbani, and B. Karimi. 2009. “A Genetic Algorithm for Solving no-Wait Flexible Flow Lines with Due Window and jOb Rejection.” The International Journal of Advanced Manufacturing Technology 42 (5-6): 523–532. https://doi.org/10.1007/s00170-008-1618-y.
   Web of Science ®Google Scholar
• Kapadia, M. S., R. Uzsoy, B. Starly, and D. P. Warsing. 2022. “A Genetic Algorithm for Order Acceptance and Scheduling in Additive Manufacturing.” International Journal of Production Research 60 (21): 6373–6390. https://doi.org/10.1080/00207543.2021.1991023.
   Web of Science ®Google Scholar
• Kaplanoğlu, V. 2014. “Multi-agent Based Approach for Single Machine Scheduling with Sequence-Dependent Setup Times and Machine Maintenance.” Applied Soft Computing 23: 165–179. https://doi.org/10.1016/j.asoc.2014.06.020.
   Web of Science ®Google Scholar
• Kappel, F., and A. V. Kuntsevich. 2000. “An Implementation of Schor's r-Algorithm.” Computational Optimization and Applications 15 (2): 193–205. https://doi.org/10.1023/A:1008739111712.
   Web of Science ®Google Scholar
• Kern, G. M., and H. H. Guerrero. 1990. “A Conceptual Model for Demand Management in the Assemble-to-Order Environment.” Journal of Operations Management 9 (1): 65–84. https://doi.org/10.1016/0272-6963(90)90146-5.
   Google Scholar
• Koulamas, C., and G. J. Kyparisis. 2022. “Two-stage no-Wait Proportionate Flow Shop Scheduling with Minimal Service Time Variation and Optional Job Rejection.” European Journal of Operational Research 305 (2): 608–616. https://doi.org/10.1016/j.ejor.2022.06.025.
   Web of Science ®Google Scholar
• Koulamas, C., and G. Steiner. 2021. “New Results for Scheduling to Minimize Tardiness on one Machine with Rejection and Related Problems.” Journal of Scheduling 24 (1): 27–34. https://doi.org/10.1007/s10951-020-00671-6.
   Web of Science ®Google Scholar
• Kutanoglu, E., and S. D. Wu. 1999. “On Combinatorial Auction and Lagrangean Relaxation for Distributed Resource Scheduling.” IIE Transactions 31 (9): 813–826.
   Web of Science ®Google Scholar
• Lei, D.-M. 2012. “Minimizing Makespan for Scheduling Stochastic Job Shop with Random Breakdown.” Applied Mathematics and Computation 218 (24): 11851–11858. https://doi.org/10.1016/j.amc.2012.04.091.
   Web of Science ®Google Scholar
• Lenstra, J. K., A. Rinnooy Kan, and P. Brucker. 1977. “Complexity of Machine Scheduling Problems.” Annals of Discrete Mathematics 1 (C): 343–362. https://doi.org/10.1016/S0167-5060(08)70743-X.
   Google Scholar
• Li, X., J. A. Ventura, and K. A. Bunn. 2021. “A Joint Order Acceptance and Scheduling Problem with Earliness and Tardiness Penalties Considering Overtime.” Journal of Scheduling 24 (1): 49–68. https://doi.org/10.1007/s10951-020-00672-5.
   Web of Science ®Google Scholar
• Li, Z., and G. Wan. 2022. “Batching and Scheduling in a Continuous-Discrete Hybrid Flowshop: Lagrangian Relaxation-Based Heuristic Algorithms.” International Journal of Production Research 61 (17): 5934–5955. https://doi.org/10.1080/00207543.2022.2119294.
   Web of Science ®Google Scholar
• Li, Q., D. Zhang, and I. Kucukkoc. 2019. “Order Acceptance and Scheduling in Direct Digital Manufacturing with Additive Manufacturing.” IFAC-PapersOnLine 52 (13): 1016–1021. https://doi.org/10.1016/j.ifacol.2019.11.328.
   Google Scholar
• Liang, Z., M. Liu, P. Zhong, and C. Zhang. 2023. “Application Research of a new Neighbourhood Structure with Adaptive Genetic Algorithm for Job Shop Scheduling Problem.” International Journal of Production Research 61 (2): 362–381. https://doi.org/10.1080/00207543.2021.2007310.
   Web of Science ®Google Scholar
• Liu, J., and K. P. Sycara. 1995, June. “Exploiting problem structure for distributed constraint optimization.” Proceedings of the First International Conference on Multiagent Systems 95: 246–254.
   Google Scholar
• Masmoudi, O., X. Delorme, and P. Gianessi. 2019. “Job-shop Scheduling Problem with Energy Consideration.” International Journal of Production Economics 216: 12–22. https://doi.org/10.1016/j.ijpe.2019.03.021.
   Web of Science ®Google Scholar
• May, G., B. Stahl, M. Taisch, and V. Prabhu. 2015. “Multi-objective Genetic Algorithm for Energy-Efficient Job Shop Scheduling.” International Journal of Production Research 53 (23): 7071–7089. https://doi.org/10.1080/00207543.2015.1005248.
   Web of Science ®Google Scholar
• Mestry, S., P. Damodaran, and C.-S. Chen. 2011. “A Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations.” European Journal of Operational Research 211 (3): 480–495. https://doi.org/10.1016/j.ejor.2011.01.002.
   Web of Science ®Google Scholar
• Möhring, R. H., A. S. Schulz, F. Stork, and M. Uetz. 2003. “Solving Project Scheduling Problems by Minimum Cut.” Management Science 49 (3): 330–350. https://doi.org/10.1287/mnsc.49.3.330.12737.
   Web of Science ®Google Scholar
• Moon, I., S. Lee, and H. Bae. 2008. “Genetic Algorithms for Job Shop Scheduling Problems with Alternative Routings.” International Journal of Production Research 46 (10): 2695–2705. https://doi.org/10.1080/00207540701244820.
   Web of Science ®Google Scholar
• Najafzad, H., H. Davari-Ardakani, and R. Nemati. 2019. “Multi-skill Project Scheduling Problem Under Time-of-use Electricity Tariffs and Shift Differential Payments.” Energy 168 (1): 619–636. https://doi.org/10.1016/j.energy.2018.11.070.
   Google Scholar
• Nguyen, S., M. Zhang, M. Johnston, and K. C. Tan. 2013. “Learning Iterative Dispatching Rules for Job Shop Scheduling with Genetic Programming.” International Journal of Advanced Manufacturing Technology 67 (1-4): 85–100. https://doi.org/10.1007/s00170-013-4756-9.
   Web of Science ®Google Scholar
• Nobibon, F. T., and R. Leus. 2011. “Exact Algorithms for a Generalization of the Order Acceptance and Scheduling Problem in a Single-Machine Environment.” Computers and Operations Research 38 (1): 367–378. https://doi.org/10.1016/j.cor.2010.06.003.
   Web of Science ®Google Scholar
• Og˘uz, C., F. S. Salman, and Z. B. Yalçın. 2010. “Order Acceptance and Scheduling Decisions in Make-to-Order Systems.” International Journal of Production Economics 125 (1): 200–211. https://doi.org/10.1016/j.ijpe.2010.02.002.
   Web of Science ®Google Scholar
• Ourari, S., L. Berrandjia, R. Boulakhras, A. Boukciat, and H. Hentous. 2015. “Robust Approach for Centralized Job Shop Scheduling: Sequential Flexibility.” IFAC-PapersOnLine 48 (3): 1960–1965. https://doi.org/10.1016/j.ifacol.2015.06.375.
   Google Scholar
• Panwalkar, S. S., and W. Iskander. 1977. “A Survey of Scheduling Rules.” Operations Research 25 (1): 45–61. https://doi.org/10.1287/opre.25.1.45.
   Web of Science ®Google Scholar
• Parunak, H. V. 1987. “Manufacturing Experience with the Contract Net.” In Distributed Artificial Intelligence, edited by M. N. Huhns, 285–310. London: Morgan Kaufmann.
   Google Scholar
• Peng, C., G. Wu, T. W. Liao, and H. Wang. 2019. “Research on Multi-Agent Genetic Algorithm Based on Tabu Search for the Job Shop Scheduling Problem.” PLoS One 14 (9): 0223182.
   Web of Science ®Google Scholar
• Plambeck, E. L., and T. A. Taylor. 2005. “Sell the Plant? The Impact of Contract Manufacturing on Innovation, Capacity, and Profitability.” Management Science 51 (1): 133–150. https://doi.org/10.1287/mnsc.1040.0212.
   Web of Science ®Google Scholar
• Poljak, B. T. 1967. “A General Method for Solving Extremum Problems.” Soviet Mathematics Doklady 8 (3): 593–597.
   Google Scholar
• Polo-Mejía, O., C. Artigues, P. Lopez, and V. Basini. 2020. “Mixed-integer/linear and Constraint Programming Approaches for Activity Scheduling in a Nuclear Research Facility.” International Journal of Production Research 58 (23): 7149–7166. https://doi.org/10.1080/00207543.2019.1693654.
   Web of Science ®Google Scholar
• Pourbabai, B. 1992. “Optimal Selection of Orders in a Just-in-Time Manufacturing Environment: A Loading Model for a Computer Integrated Manufacturing System.” International Journal of Computer Integrated Manufacturing 5 (1): 38–44. https://doi.org/10.1080/095119X9208547564.
   Web of Science ®Google Scholar
• Pritsker, A. A., L. J. Watters, and P. M. Wolfe. 1969. “Multiproject Scheduling with Limited Resources: A Zero-one Programming Approach.” Management Science 16 (1): 93–108. https://doi.org/10.1287/mnsc.16.1.93.
   Web of Science ®Google Scholar
• Qin, J., Y. Liu, and R. Grosvenor. 2016. “A Categorical Framework of Manufacturing for Industry 4.0 and Beyond.” Procedia CIRP 52: 173–178. https://doi.org/10.1016/j.procir.2016.08.005.
   Google Scholar
• Qing-dao-er-ji, R., and Y. Wang. 2012. “A new Hybrid Genetic Algorithm for Job Shop Scheduling Problem.” Computers and Operations Research 39 (10): 2291–2299. https://doi.org/10.1016/j.cor.2011.12.005.
   Web of Science ®Google Scholar
• Rom, W. O., and S. A. Slotnick. 2009. “Order Acceptance Using Genetic Algorithms.” Computers and Operations Research 36 (6): 1758–1767. https://doi.org/10.1016/j.cor.2008.04.010.
   Web of Science ®Google Scholar
• Roundy, R., D. Chen, P. Chen, M. Çakanyildirim, M. B. Freimer, and V. Melkonian. 2005. “Capacity-driven Acceptance of Customer Orders for a Multi-Stage Batch Manufacturing System: Models and Algorithms.” IIE Transactions 37 (12): 1093–1105. https://doi.org/10.1080/07408170500288042.
   Web of Science ®Google Scholar
• Roundy, R. O., W. L. Maxwell, Y. T. Herer, S. R. Tayur, and A. W. Getzler. 1991. “A Price-Directed Approach to Real-Time Scheduling of Production Operations.” IIE Transactions 23 (2): 149–160. https://doi.org/10.1080/07408179108963850.
   Web of Science ®Google Scholar
• Saeidlou, S., M. Saadat, and G. D. Jules. 2019. “Knowledge and Agent-Based System for Decentralised Scheduling in Manufacturing.” Cogent Engineering 6 (1): 1582309. https://doi.org/10.1080/23311916.2019.1582309.
   Web of Science ®Google Scholar
• Saeidlou, S., M. Saadat, and G. D. Jules. 2021. “Towards Decentralised Job Shop Scheduling as a Web Service.” Cogent Engineering 8 (1): 1938795. https://doi.org/10.1080/23311916.2021.1938795.
   Web of Science ®Google Scholar
• Salido, M. A., J. Escamilla, A. Giret, and F. Barber. 2016. “A Genetic Algorithm for Energy-Efficiency in Job-Shop Scheduling.” The International Journal of Advanced Manufacturing Technology 85 (5-8): 1303–1314. https://doi.org/10.1007/s00170-015-7987-0.
   Web of Science ®Google Scholar
• Sánchez, M. G., E. Lalla-Ruiz, A. F. Gil, C. Castro, and S. Voß. 2023. “Resource-constrained Multi-Project Scheduling Problem: A Survey.” European Journal of Operational Research 309 (3): 958–976. https://doi.org/10.1016/j.ejor.2022.09.033.
   Web of Science ®Google Scholar
• Shi, F., S. Zhao, and Y. Meng. 2020. “Hybrid Algorithm Based on Improved Extended Shifting Bottleneck Procedure and GA for Assembly Job Shop Scheduling Problem.” International Journal of Production Research 58 (9): 2604–2625. https://doi.org/10.1080/00207543.2019.1622052.
   Web of Science ®Google Scholar
• Siwamogsatham, T., and C. Saygin. 2004. “Auction-based Distributed Scheduling and Control Scheme for Flexible Manufacturing Systems.” International Journal of Production Research 42 (3): 547–572. https://doi.org/10.1080/00207540310001613683.
   Web of Science ®Google Scholar
• Slotnick, S. A. 2011. “Order Acceptance and Scheduling: A Taxonomy and Review.” European Journal of Operational Research 212 (1): 1–11. https://doi.org/10.1016/j.ejor.2010.09.042.
   Web of Science ®Google Scholar
• Smith, R. G. 1980. “The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver.” IEEE Transactions on Computers C-29 (12): 1104–1113. https://doi.org/10.1109/TC.1980.1675516.
   Web of Science ®Google Scholar
• Snauwaert, J., and M. Vanhoucke. 2022. “Mathematical Formulations for Project Scheduling Problems with Categorical and Hierarchical Skills.” Computers & Industrial Engineering 169: 108147. https://doi.org/10.1016/j.cie.2022.108147.
   Web of Science ®Google Scholar
• Snoek, M. 2000. “Neuro-Genetic Order Acceptance in a Job Shop Setting.” Proceedings of the Seventh International Conference on Neural Information Processing, 815–819. Taejon, Korea.
   Google Scholar
• Sotskov, Y. N., and N. V. Shakhlevich. 1995. “NP-hardness of Shop-Scheduling Problems with Three Jobs.” Discrete Applied Mathematics 59 (3): 237–266. https://doi.org/10.1016/0166-218X(95)80004-N.
   Web of Science ®Google Scholar
• Su, H., M. Pinedo, and G. Wan. 2017. “Parallel Machine Scheduling with Eligibility Constraints: A Composite Dispatching Rule to Minimize Total Weighted Tardiness.” Naval Research Logistics 64 (3): 249–267. https://doi.org/10.1002/nav.21744.
   Web of Science ®Google Scholar
• Tang, J., C. Zeng, and Z. Pan. 2016. “Auction-based Cooperation Mechanism to Parts Scheduling for Flexible Job Shop with Inter-Cells.” Applied Soft Computing 49: 590–602. https://doi.org/10.1016/j.asoc.2016.08.046.
   Web of Science ®Google Scholar
• Thomalla, C. S. 2001. “Job Shop Scheduling with Alternative Process Plans.” International Journal of Production Economics 74 (1-3): 125–134. https://doi.org/10.1016/S0925-5273(01)00119-0.
   Web of Science ®Google Scholar
• Tikhomirov, A. I. 2019. “The English Auction Method for Scheduling Jobs in a Distributed Network of Supercomputer Centers.” Lobachevskii Journal of Mathematics 40 (5): 606–613. https://doi.org/10.1134/S1995080219050214.
   Web of Science ®Google Scholar
• Triki, C., S. Piya, and L-L Fu. 2020. “Integrating Production Scheduling and Transportation Procurement Through Combinatorial Auctions.” Networks 76 (2): 147–163. https://doi.org/10.1002/net.21967.
   Web of Science ®Google Scholar
• Vela, C. R., S. Afsar, J. J. Palacios, I. González-Rodríguez, and J. Puente. 2020. “Evolutionary Tabu Search for Flexible due-Date Satisfaction in Fuzzy Job Shop Scheduling.” Computers and Operations Research 119: 104931. https://doi.org/10.1016/j.cor.2020.104931.
   Web of Science ®Google Scholar
• Wang, H., B. R. Sarker, J. Li, and J. Li. 2021. “Adaptive Scheduling for Assembly Job Shop with Uncertain Assembly Times Based on Dual Q-Learning.” International Journal of Production Research 59 (19): 5867–5883. https://doi.org/10.1080/00207543.2020.1794075.
   Web of Science ®Google Scholar
• Wang, S., and B. Ye. 2019. “Exact Methods for Order Acceptance and Scheduling on Unrelated Parallel Machines.” Computers and Operations Research 104: 159–173. https://doi.org/10.1016/j.cor.2018.12.016.
   Web of Science ®Google Scholar
• Weckman, G. R., C. V. Ganduri, and D. A. Koonce. 2008. “A Neural Network job-Shop Scheduler.” Journal of Intelligent Manufacturing 19 (2): 191–201. https://doi.org/10.1007/s10845-008-0073-9.
   Web of Science ®Google Scholar
• Wei, J., and Y. S. Ma. 2014. “Design of a Feature-Based Order Acceptance and Scheduling Module in an ERP System.” Computers in Industry 65 (1): 64–78. https://doi.org/10.1016/j.compind.2013.07.009
   Web of Science ®Google Scholar
• Weiming, S., W. Lihui, and H. Qi. 2006. “Agent-based Distributed Manufacturing Process Planning and Scheduling: A State-of-the-art Survey.” IEEE Transactions on Systems, Man, and Cybernetics. Part C, Applications and Reviews 36 (4): 563–577.
   Web of Science ®Google Scholar
• Widmer, M. 2017. “Job Shop Scheduling with Tooling Constraints: A Tabu Search Approach.” The Journal of the Operational Research Society 42 (1): 75–82. https://doi.org/10.1057/jors.1991.9.
   Google Scholar
• Wong, T. C., F. T. Chan, and L. Y. Chan. 2009. “A Resource-Constrained Assembly Job Shop Scheduling Problem with lot Streaming Technique.” Computers & Industrial Engineering 57 (3): 983–995. https://doi.org/10.1016/j.cie.2009.04.002.
   Web of Science ®Google Scholar
• Zeng, C., G. Qi, Z. Liu, J. Tang, Z.-P. Fan, and C. Yan. 2022. “Auction-based Approach with Improved Disjunctive Graph Model for Job Shop Scheduling Problem with Parallel Batch Processing.” Engineering Applications of Artificial Intelligence 110: 104735. https://doi.org/10.1016/j.engappai.2022.104735
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, Z. P. Fan, and C. J. Yan. 2019. “Auction-based Approach for a Flexible Job-Shop Scheduling Problem with Multiple Process Plans.” Engineering Optimization 51 (11): 1902–1919. https://doi.org/10.1080/0305215X.2018.1561884.
   Web of Science ®Google Scholar
• Zhang, S., X. Li, B. Zhang, and S. Wang. 2020. “Multi-objective Optimisation in Flexible Assembly Job Shop Scheduling Using a Distributed Ant Colony System.” European Journal of Operational Research 283 (2): 441–460. https://doi.org/10.1016/j.ejor.2019.11.016.
   Web of Science ®Google Scholar
• Zhang, H., and R. Utpal. 2018. “A Semantics-Based Dispatching Rule Selection Approach for Job Shop Scheduling.” Journal of Intelligent Manufacturing 30 (7): 2759–2779. https://doi.org/10.1007/s10845-018-1421-z.
   Web of Science ®Google Scholar
• Zhong, X., J. Ou, and G. Wang. 2014. “Order Acceptance and Scheduling with Machine Availability Constraints.” European Journal of Operational Research 232 (3): 435–441. https://doi.org/10.1016/j.ejor.2013.07.032.
   Web of Science ®Google Scholar