IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v42y1996i6p797-813.html
   My bibliography  Save this item

A Fast Taboo Search Algorithm for the Job Shop Problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Tarantilis, C. D. & Kiranoudis, C. T., 2002. "A list-based threshold accepting method for job shop scheduling problems," International Journal of Production Economics, Elsevier, vol. 77(2), pages 159-171, May.
  2. Tamssaouet, Karim & Dauzère-Pérès, Stéphane, 2023. "A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 311(2), pages 455-471.
  3. Susana Fernandes & Helena Ramalhinho-Lourenço, 2007. "A simple optimised search heuristic for the job-shop scheduling problem," Economics Working Papers 1050, Department of Economics and Business, Universitat Pompeu Fabra.
  4. Groflin, Heinz & Klinkert, Andreas, 2007. "Feasible insertions in job shop scheduling, short cycles and stable sets," European Journal of Operational Research, Elsevier, vol. 177(2), pages 763-785, March.
  5. Julia Schulz & Daniel Leinmüller & Adam Misik & Michael F. Zaeh, 2021. "Renewable On-Site Power Generation for Manufacturing Companies—Technologies, Modeling, and Dimensioning," Sustainability, MDPI, vol. 13(7), pages 1-27, April.
  6. Li, Guo & Li, Na & Sambandam, Narayanasamy & Sethi, Suresh P. & Zhang, Faping, 2018. "Flow shop scheduling with jobs arriving at different times," International Journal of Production Economics, Elsevier, vol. 206(C), pages 250-260.
  7. Hurink, Johann & Knust, Sigrid, 2005. "Tabu search algorithms for job-shop problems with a single transport robot," European Journal of Operational Research, Elsevier, vol. 162(1), pages 99-111, April.
  8. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1998. "The flow shop with parallel machines: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 226-253, April.
  9. Allet, Samir, 2003. "Handling flexibility in a "generalised job shop" with a fuzzy approach," European Journal of Operational Research, Elsevier, vol. 147(2), pages 312-333, June.
  10. Zhang, Rui & Chang, Pei-Chann & Wu, Cheng, 2013. "A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production," International Journal of Production Economics, Elsevier, vol. 145(1), pages 38-52.
  11. Gromicho, J.A.S. & Hoorn, J.J. van & Timmer, G.T., 2009. "Exponentially better than brute force: solving the jobshop scheduling problem optimally by dynamic programming," Serie Research Memoranda 0056, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
  12. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November.
  13. Ulrike Schneider, 2011. "A tabu search tutorial based on a real-world scheduling problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(4), pages 467-493, December.
  14. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
  15. Z C Zhu & K M Ng & H L Ong, 2010. "A modified tabu search algorithm for cost-based job shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 611-619, April.
  16. Raja Awais Liaqait & Shermeen Hamid & Salman Sagheer Warsi & Azfar Khalid, 2021. "A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0," Sustainability, MDPI, vol. 13(14), pages 1-19, July.
  17. Satake, Tsuyoshi & Morikawa, Katsumi & Takahashi, Katsuhiko & Nakamura, Nobuto, 1999. "Simulated annealing approach for minimizing the makespan of the general job-shop," International Journal of Production Economics, Elsevier, vol. 60(1), pages 515-522, April.
  18. Reinhard Bürgy, 2017. "A neighborhood for complex job shop scheduling problems with regular objectives," Journal of Scheduling, Springer, vol. 20(4), pages 391-422, August.
  19. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
  20. Rossi, Andrea, 2014. "Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships," International Journal of Production Economics, Elsevier, vol. 153(C), pages 253-267.
  21. Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
  22. Mogali, Jayanth Krishna & Barbulescu, Laura & Smith, Stephen F., 2021. "Efficient primal heuristic updates for the blocking job shop problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 82-101.
  23. P M E Shutler, 2003. "A priority list based heuristic for the job shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 571-584, June.
  24. Pongcharoen, P. & Hicks, C. & Braiden, P. M. & Stewardson, D. J., 2002. "Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products," International Journal of Production Economics, Elsevier, vol. 78(3), pages 311-322, August.
  25. Pongcharoen, P. & Hicks, C. & Braiden, P. M., 2004. "The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure," European Journal of Operational Research, Elsevier, vol. 152(1), pages 215-225, January.
  26. Jiae Zhang & Jianjun Yang, 2016. "Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4894-4918, August.
  27. Wei-Chu Weng, 2011. "A special combinatorial problem: pitch arrangement for pneumatic tires," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 19-34, July.
  28. Torres, Philippe & Lopez, Pierre, 2000. "On Not-First/Not-Last conditions in disjunctive scheduling," European Journal of Operational Research, Elsevier, vol. 127(2), pages 332-343, December.
  29. Heber F. Amaral & Sebastián Urrutia & Lars M. Hvattum, 2021. "Delayed improvement local search," Journal of Heuristics, Springer, vol. 27(5), pages 923-950, October.
  30. J. Christopher Beck & T. K. Feng & Jean-Paul Watson, 2011. "Combining Constraint Programming and Local Search for Job-Shop Scheduling," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 1-14, February.
  31. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
  32. García-Villoria, Alberto & Corominas, Albert & Nadal, Adrià & Pastor, Rafael, 2018. "Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints," European Journal of Operational Research, Elsevier, vol. 271(3), pages 882-895.
  33. P Corry & E Kozan, 2004. "Job scheduling with technical constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 160-169, February.
  34. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
  35. Negenman, Ebbe G., 2001. "Local search algorithms for the multiprocessor flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 147-158, January.
  36. Pempera, Jaroslaw & Smutnicki, Czeslaw, 2018. "Open shop cyclic scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 773-781.
  37. Heinz Gröflin & Dinh Nguyen Pham & Reinhard Bürgy, 2011. "The flexible blocking job shop with transfer and set-up times," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 121-144, August.
  38. Gregory A. Kasapidis & Dimitris C. Paraskevopoulos & Panagiotis P. Repoussis & Christos D. Tarantilis, 2021. "Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4044-4068, November.
  39. Murovec, Bostjan & Suhel, Peter, 2004. "A repairing technique for the local search of the job-shop problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 220-238, February.
  40. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
  41. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
  42. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
  43. Michela Milano & Mark Wallace, 2010. "Integrating Operations Research in Constraint Programming," Annals of Operations Research, Springer, vol. 175(1), pages 37-76, March.
  44. Christian Artigues & Dominique Feillet, 2008. "A branch and bound method for the job-shop problem with sequence-dependent setup times," Annals of Operations Research, Springer, vol. 159(1), pages 135-159, March.
  45. Tamer Abdelmaguid & Mohamed Shalaby & Mohamed Awwad, 2014. "A tabu search approach for proportionate multiprocessor open shop scheduling," Computational Optimization and Applications, Springer, vol. 58(1), pages 187-203, May.
  46. Karen Aardal & Cor Hurkens & Jan Karel Lenstra & Sergey Tiourine, 2002. "Algorithms for Radio Link Frequency Assignment: The Calma Project," Operations Research, INFORMS, vol. 50(6), pages 968-980, December.
  47. Mati, Yazid & Dauzère-Pérès, Stèphane & Lahlou, Chams, 2011. "A general approach for optimizing regular criteria in the job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 212(1), pages 33-42, July.
  48. Li, Xinyu & Shao, Xinyu & Gao, Liang & Qian, Weirong, 2010. "An effective hybrid algorithm for integrated process planning and scheduling," International Journal of Production Economics, Elsevier, vol. 126(2), pages 289-298, August.
  49. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
  50. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
  51. Murovec, Boštjan, 2015. "Job-shop local-search move evaluation without direct consideration of the criterion’s value," European Journal of Operational Research, Elsevier, vol. 241(2), pages 320-329.
  52. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.
  53. Drótos, Márton & Erdos, Gábor & Kis, Tamás, 2009. "Computing lower and upper bounds for a large-scale industrial job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 296-306, August.
  54. Ansis Ozolins, 2020. "Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times," Operational Research, Springer, vol. 20(3), pages 1701-1728, September.
  55. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
  56. Philippe Lacomme & Aziz Moukrim & Alain Quilliot & Marina Vinot, 2019. "Integration of routing into a resource-constrained project scheduling problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 421-464, December.
  57. Shen, Liji & Dauzère-Pérès, Stéphane & Maecker, Söhnke, 2023. "Energy cost efficient scheduling in flexible job-shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 310(3), pages 992-1016.
  58. Bryan A. Norman & James C. Bean, 1999. "A genetic algorithm methodology for complex scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 199-211, March.
  59. Chien, Chen-Fu & Tseng, Fang-Pin & Chen, Chien-Hung, 2008. "An evolutionary approach to rehabilitation patient scheduling: A case study," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1234-1253, September.
  60. Shen, Liji & Dauzère-Pérès, Stéphane & Neufeld, Janis S., 2018. "Solving the flexible job shop scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(2), pages 503-516.
  61. Chiang, Tsung-Che & Lin, Hsiao-Jou, 2013. "A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling," International Journal of Production Economics, Elsevier, vol. 141(1), pages 87-98.
  62. Nowicki, Eugeniusz, 1999. "The permutation flow shop with buffers: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 116(1), pages 205-219, July.
  63. Tjark Vredeveld & Cor Hurkens, 2002. "Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 175-189, May.
  64. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
  65. Zhao Peng & Huan Zhang & Hongtao Tang & Yue Feng & Weiming Yin, 2022. "Research on flexible job-shop scheduling problem in green sustainable manufacturing based on learning effect," Journal of Intelligent Manufacturing, Springer, vol. 33(6), pages 1725-1746, August.
  66. Chen, Haoxun & Luh, Peter B., 2003. "An alternative framework to Lagrangian relaxation approach for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 149(3), pages 499-512, September.
  67. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.
  68. Pezzella, Ferdinando & Merelli, Emanuela, 2000. "A tabu search method guided by shifting bottleneck for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 297-310, January.
  69. González, Miguel A. & Vela, Camino R. & Varela, Ramiro, 2015. "Scatter search with path relinking for the flexible job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 245(1), pages 35-45.
  70. Amaral Armentano, Vinicius & Rigao Scrich, Cintia, 2000. "Tabu search for minimizing total tardiness in a job shop," International Journal of Production Economics, Elsevier, vol. 63(2), pages 131-140, January.
  71. Paul M E Shutler, 2004. "A priority list based heuristic for the job shop problem: part 2 tabu search," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 780-784, July.
  72. Aardal, K. & van Hoesel, C.P.M. & Lenstra, J.K. & Stougie, L., 1997. "A decade of combinatorial optimization," Research Memorandum 023, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  73. Ho, Nhu Binh & Tay, Joc Cing & Lai, Edmund M.-K., 2007. "An effective architecture for learning and evolving flexible job-shop schedules," European Journal of Operational Research, Elsevier, vol. 179(2), pages 316-333, June.
  74. Kolisch, Rainer & Hartmann, Sönke, 1998. "Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 469, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  75. T. C. E. Cheng & Bo Peng & Zhipeng Lü, 2016. "A hybrid evolutionary algorithm to solve the job shop scheduling problem," Annals of Operations Research, Springer, vol. 242(2), pages 223-237, July.
  76. M. Calhoun, Kevin & Deckro, Richard F. & Moore, James T. & Chrissis, James W. & Van Hove, John C., 2002. "Planning and re-planning in project and production scheduling," Omega, Elsevier, vol. 30(3), pages 155-170, June.
  77. Reinhard Bürgy & Heinz Gröflin, 2016. "The blocking job shop with rail-bound transportation," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 152-181, January.
  78. An, Youjun & Chen, Xiaohui & Hu, Jiawen & Zhang, Lin & Li, Yinghe & Jiang, Junwei, 2022. "Joint optimization of preventive maintenance and production rescheduling with new machine insertion and processing speed selection," Reliability Engineering and System Safety, Elsevier, vol. 220(C).
  79. Fraj Naifar & Mariem Gzara & Moalla Taicir Loukil, 2020. "A new leader guided optimization for the flexible job shop problem," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 602-617, February.
  80. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
  81. Benavides, Alexander J. & Ritt, Marcus & Miralles, Cristóbal, 2014. "Flow shop scheduling with heterogeneous workers," European Journal of Operational Research, Elsevier, vol. 237(2), pages 713-720.
  82. Brailsford, Sally C. & Potts, Chris N. & Smith, Barbara M., 1999. "Constraint satisfaction problems: Algorithms and applications," European Journal of Operational Research, Elsevier, vol. 119(3), pages 557-581, December.
  83. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
  84. Oliveira, Jose Antonio, 2007. "Scheduling the truckload operations in automatic warehouses," European Journal of Operational Research, Elsevier, vol. 179(3), pages 723-735, June.
  85. Chong Peng & Guanglin Wu & T Warren Liao & Hedong Wang, 2019. "Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem," PLOS ONE, Public Library of Science, vol. 14(9), pages 1-19, September.
  86. Yang-Kuei Lin & Chin Soon Chong, 2017. "Fast GA-based project scheduling for computing resources allocation in a cloud manufacturing system," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1189-1201, June.
  87. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
  88. Jens Poppenborg & Sigrid Knust, 2016. "A flow-based tabu search algorithm for the RCPSP with transfer times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 305-334, March.
  89. Julien Autuori & Faicel Hnaien & Farouk Yalaoui, 2016. "A mapping technique for better solution exploration: NSGA-II adaptation," Journal of Heuristics, Springer, vol. 22(1), pages 89-123, February.
  90. Fei Luan & Zongyan Cai & Shuqiang Wu & Tianhua Jiang & Fukang Li & Jia Yang, 2019. "Improved Whale Algorithm for Solving the Flexible Job Shop Scheduling Problem," Mathematics, MDPI, vol. 7(5), pages 1-14, April.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.