Comparative study of different heuristics algorithms in solving classical job shop scheduling problem-Reference-Cited by-同舟云学术

Comparative study of different heuristics algorithms in solving classical job shop scheduling problem

Published:2020 Issue: Volume:22 Page:1796-1802
ISSN:2214-7853
Container-title:Materials Today: Proceedings
language:en
Short-container-title:Materials Today: Proceedings

Author:

Kumar Neeraj,Mishra Abhishek

Publisher

Elsevier BV

Subject

General Medicine

Reference15 articles.

1. Brucker, P., Hilbig, T., Hurink, J., A branch and bound algorithm for scheduling problems with positive and negative time-lags, Tech. rep., Osnabrueck University 1996.

2. Benchmarks for basic scheduling problems;Taillard;European journal of operational research,1993

3. Ant system for job-shop scheduling;Colorni;Belgian Journal of Operations Research, Statistics and Computer Science,1994

4. P. J. van Laarhoven, E. H. Aarts, and J. K. Lenstra, Job shop scheduling by simulated annealing, Operations research, 40(1), 113-125

5. Job-shop scheduling: Computational study of local search and large-step optimization methods;Lourenco;European Journal of Operational Research,1995

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Processing Time Performance Analysis of Scheduling Algorithms for Virtual Machines Placement in Cloud Computing Environment;Proceedings of the 6th International Conference on Big Data and Internet of Things;2023

2. A Novel Production Scheduling Approach Based on Improved Hybrid Genetic Algorithm;Sustainability;2022-09-19

3. Flow-shop path planning for multi-automated guided vehicles in intelligent textile spinning cyber-physical production systems dynamic environment;Journal of Manufacturing Systems;2021-04