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

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 ◽

Unrelated Parallel Machines ◽

Weighted Completion Time ◽

Customer Orders

A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

Mathematics of Operations Research ◽

10.1287/moor.25.1.63.15212 ◽

2000 ◽

Vol 25 (1) ◽

pp. 63-75 ◽

Cited By ~ 27

Author(s):

Martin Skutella ◽

Gerhard J. Woeginger

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Identical Parallel Machines ◽

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 ◽

Unrelated Parallel Machines ◽

Weighted Completion Time Minimization for Capacitated Parallel Machines

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-92702-8_9 ◽

2021 ◽

pp. 130-143

Author(s):

Ilan Reuven Cohen ◽

Izack Cohen ◽

Iyar Zaks

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Time Minimization ◽

Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines

Electronic Notes in Discrete Mathematics ◽

10.1016/j.endm.2010.05.069 ◽

2010 ◽

Vol 36 ◽

pp. 543-550 ◽

Cited By ~ 1

Author(s):

Makram Zaidi ◽

Bassem Jarboui ◽

Imed Kacem ◽

Taicir Loukil

Keyword(s):

Completion Time ◽

Parallel Machines ◽

A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

2006 International Conference on Service Systems and Service Management ◽

10.1109/icsssm.2006.320678 ◽

2006 ◽

Cited By ~ 2

Author(s):

Rabia Nessah ◽

Farouk Yalaoui

Keyword(s):

Branch And Bound ◽

Completion Time ◽

Parallel Machines ◽

Branch And Bound Algorithm ◽

Release Dates ◽

Identical Parallel Machines ◽

A new dynamic programming algorithm for the parallel machines total weighted completion time problem

Operations Research Letters ◽

10.1016/0167-6377(92)90035-2 ◽

1992 ◽

Vol 11 (2) ◽

pp. 73-75 ◽

Cited By ~ 28

Author(s):

Chung-Yee Lee ◽

Reha Uzsoy

Keyword(s):

Dynamic Programming ◽

Completion Time ◽

Parallel Machines ◽

Dynamic Programming Algorithm ◽

Programming Algorithm ◽

Time Problem ◽

Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work

Naval Research Logistics (NRL) ◽

10.1002/nav.21961 ◽

2020 ◽

Cited By ~ 1

Author(s):

Yuan Zhang ◽

Jinjiang Yuan ◽

Chi To Ng ◽

Tai Chiu E. Cheng

Keyword(s):

Completion Time ◽

Pareto Optimization ◽

Late Work ◽

Number Of Tardy Jobs ◽

Agent Scheduling ◽

Weighted Number ◽

Weighted Completion Time ◽

Tardy Jobs

Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization

European Journal of Operational Research ◽

10.1016/j.ejor.2019.07.006 ◽

2021 ◽

Vol 289 (3) ◽

pp. 825-840 ◽

Cited By ~ 2

Author(s):

Arthur Kramer ◽

Manuel Iori ◽

Philippe Lacomme

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Setup Times ◽

Identical Parallel Machines ◽

Time Minimization ◽