Cited By
View all- Ripon KSingh A(2023)Quantum Representation Based Job Shop Scheduling2023 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI52147.2023.10371799(1227-1233)Online publication date: 5-Dec-2023
Genetic algorithms were intensively investigated in various modifications and in combinations with other algorithms for solving the NP-hard scheduling problem. This extended abstract describes a genetic algorithm approach for solving large job shop ...
A stochastic flexible scheduling problem subject to random breakdowns is studied in this paper, which objective is to minimize the expected value of makespan. We consider a preemptive-resume model of breakdown. The processing times, breakdown intervals ...
An adaptive genetic algorithm with some improvement is proposed to solve the job-shop scheduling problem (JSSP) better. The improved adaptive genetic algorithm (IAGA) obtained by applying the improved sigmoid function to adaptive genetic algorithm. And ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in