Ordered minimum completion time heuristic for unrelated parallel-machines problems

2014 9th Iberian Conference on Information Systems and Technologies (CISTI) ◽

10.1109/cisti.2014.6876939 ◽

2014 ◽

Author(s):

Andre Serra e Santos ◽

Ana Maria Madureira

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Unrelated Parallel Machines ◽

Minimum Completion Time

Download Full-text

An ordered approach to Minimum Completion Time in unrelated parallel-machines for the makespan optimization

2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014) ◽

10.1109/nabic.2014.6921856 ◽

2014 ◽

Author(s):

Andre Serra e Santos ◽

Ana Maria Madureira ◽

Maria Leonilde R. Varela

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Unrelated Parallel Machines ◽

Minimum Completion Time

Download Full-text

A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

Optimization Letters ◽

10.1007/s11590-013-0655-0 ◽

2013 ◽

Vol 8 (4) ◽

pp. 1577-1589 ◽

Cited By ~ 7

Author(s):

Eduardo Conde

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Completion Time ◽

Unrelated Parallel Machines ◽

Minmax Regret

Download Full-text

Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time

Journal of the Operational Research Society ◽

10.1080/01605682.2020.1718010 ◽

2020 ◽

pp. 1-11

Author(s):

Haidong Li ◽

Zhen Li ◽

Yaping Zhao ◽

Xiaoyun Xu

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Weighted Completion Time ◽

Unrelated Parallel Machines ◽

Weighted Completion Time ◽

Customer Orders

Download Full-text

Minimizing the Total Weighted Completion Time on Unrelated Parallel Machines with Stochastic Times

Proceedings of the Winter Simulation Conference, 2005. ◽

10.1109/wsc.2005.1574499 ◽

2006 ◽

Cited By ~ 2

Author(s):

J.-P.M. Arnaout ◽

G. Rabadi

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Weighted Completion Time ◽

Unrelated Parallel Machines ◽

Weighted Completion Time

Download Full-text

Customer Order Scheduling on Unrelated Parallel Machines to Minimize Total Completion Time

IEEE Transactions on Automation Science and Engineering ◽

10.1109/tase.2013.2291899 ◽

2015 ◽

Vol 12 (1) ◽

pp. 244-257 ◽

Cited By ~ 9

Author(s):

Xiaoyun Xu ◽

Ying Ma ◽

Zihuan Zhou ◽

Yaping Zhao

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Completion Time ◽

Unrelated Parallel Machines ◽

Order Scheduling ◽

Customer Order ◽

Customer Order Scheduling

Download Full-text

Maximizing the minimum completion time on parallel machines

4OR ◽

10.1007/s10288-007-0053-5 ◽

2007 ◽

Vol 6 (4) ◽

pp. 375-392 ◽

Cited By ~ 10

Author(s):

Mohamed Haouari ◽

Mahdi Jemmali

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Minimum Completion Time

Download Full-text

Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria

Journal of Scheduling ◽

10.1007/s10951-018-0583-z ◽

2018 ◽

Vol 22 (3) ◽

pp. 315-333 ◽

Cited By ~ 7

Author(s):

Yunqiang Yin ◽

Youhua Chen ◽

Kaida Qin ◽

Dujuan Wang

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Completion Time ◽

Unrelated Parallel Machines ◽

Number Of Tardy Jobs ◽

Agent Scheduling ◽

Weighted Number ◽

Tardy Jobs

Download Full-text

Scheduling Variable Maintenances and Jobs on Unrelated Parallel Machines to Minimize the Total Completion Time

American Journal of Mathematical and Management Sciences ◽

10.1080/01966324.2016.1203849 ◽

2016 ◽

Vol 35 (4) ◽

pp. 327-334

Author(s):

Jianbo Gong ◽

Wenchang Luo

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Completion Time ◽

Unrelated Parallel Machines

Download Full-text

Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time

Annals of Operations Research ◽

10.1007/s10479-021-04043-x ◽

2021 ◽

Author(s):

Yang-Kuei Lin ◽

Tzu-Yueh Yin

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Weighted Completion Time ◽

Tardy Jobs

Download Full-text

A robust multi-response VNS-aiNet approach for solving scheduling problems under unrelated parallel machines environments

Expert Systems with Applications ◽

10.1016/j.eswa.2021.115140 ◽

2021 ◽

pp. 115140

Author(s):

Rodney Oliveira Marinho Diana ◽

Sérgio Ricardo de Souza ◽

Elizabeth Fialho Wanner

Keyword(s):

Parallel Machines ◽

Unrelated Parallel Machines ◽

Scheduling Problems

Download Full-text