From post

Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method.

, , , , , , и . Oper. Res., 24 (1): 2 (марта 2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem., и . COCOA, том 4616 из Lecture Notes in Computer Science, стр. 191-199. Springer, (2007)Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates., , , , , и . Swarm Evol. Comput., (2022)Artificial bee colony algorithms for the order scheduling with release dates., , , , , и . Soft Comput., 23 (18): 8677-8688 (2019)Particle-swarm Krill Herd Algorithm., , , , , и . IEEM, стр. 1073-1080. IEEE, (2018)Two-Stage Flow-Open Shop Scheduling Problem to Minimize Makespan., , , , , и . ICIC (1), том 9771 из Lecture Notes in Computer Science, стр. 527-535. Springer, (2016)Flexible open shop scheduling problem to minimize makespan., , и . Comput. Oper. Res., (2016)An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times., и . Appl. Math. Comput., (2014)An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling., , , и . Int. J. Prod. Res., 58 (2): 597-614 (2020)Blocking flowshop scheduling problems with release dates., , , , , , , и . Swarm Evol. Comput., (2022)Minimizing the total electricity cost and maximum lateness of the flow shop scheduling problem under time-of-use energy tariffs., , , и . ICNSC, стр. 1-6. IEEE, (2023)