Search Results - Scheduling Multi-agent Approximation algorithm Polynomial time approximation scheme

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

Authors: Lee, K Choi, BC Leung, JYT et al.

Contributors: Lee, K Choi, BC Leung, JYT et al.

Source: Information Processing Letters. 109:913-917

Subject Terms: Multi-Objective Shortest-Path problem, Multi-agent scheduling, Total weighted completion time, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Approximation algorithm, FPTAS

Access URL: https://researchwith.njit.edu/en/publications/approximation-algorithms-for-multi-agent-scheduling-to-minimize-t
https://www.sciencedirect.com/science/article/pii/S0020019009001471
https://oasis.postech.ac.kr/handle/2014.oak/72156
https://dblp.uni-trier.de/db/journals/ipl/ipl109.html#LeeCLP09
http://www.sciencedirect.com/science/article/pii/S0020019009001471

Two-agent single-machine scheduling with release dates to minimize the makespan.

Authors: Yu, Jin Liu, Peihai Lu, Xiwen

Source: Optimization Letters; Nov2023, Vol. 17 Issue 8, p1915-1937, 23p

Energy-efficient allocation for multiple tasks in mobile edge computing.

Authors: Liu, Jun Liu, Xi

Source: Journal of Cloud Computing (2192-113X); 10/27/2022, Vol. 11 Issue 1, p1-14, 14p

Subject Terms: MOBILE computing, EDGE computing, APPROXIMATION algorithms, ENERGY consumption, ASSIGNMENT problems (Programming)

Scheduling on identical machines with preemption and setup times.

Authors: Haned, Amina Kerdali, Abida Boudhar, Mourad

Source: International Journal of Production Research; Jan2024, Vol. 62 Issue 1/2, p444-459, 16p

Subject Terms: SETUP time, POLYNOMIAL time algorithms, POLYNOMIAL approximation, DYNAMIC programming, GENETIC algorithms

Parallel-batching scheduling with two agents, release dates and equal processing times.

Authors: Li, Shi-Sheng Chen, Ren-Xia

Source: International Journal of Production Research; Dec2025, Vol. 63 Issue 24, p9799-9820, 22p

Single machine scheduling with the total weighted late work and rejection cost.

Authors: Sang, Yao‐Wen Wang, Jun‐Qiang Sterna, Małgorzata et al.

Source: Naval Research Logistics; Mar2025, Vol. 72 Issue 2, p260-274, 15p

Subject Terms: SCHEDULING, PARETO analysis, NP-hard problems, APPROXIMATION algorithms, COST, APPROXIMATION theory

Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.

Authors: Chen, Rubing Gao, Yuan Geng, Zhichao et al.

Source: International Journal of Production Research; Nov2023, Vol. 61 Issue 22, p7630-7648, 19p, 4 Diagrams, 12 Charts

Subject Terms: POLYNOMIAL time algorithms, NP-hard problems, SCHEDULING, ALGORITHMS, WORKING hours

Minimizing Total Weighted Late Work in a Proportionate Flow Shop with Job Rejection.

Authors: Chen, Ren-Xia Li, Shi-Sheng Feng, Qi

Source: Asia-Pacific Journal of Operational Research; Jun2024, Vol. 41 Issue 3, p1-23, 23p

Subject Terms: FLOW shops, WORKFLOW, JOB shops, POLYNOMIAL approximation, POLYNOMIAL time algorithms

Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works.

Authors: Guo, Shuen Geng, Zhichao Yuan, Jinjiang

Source: Journal of Industrial & Management Optimization; Jan2023, Vol. 19 Issue 1, p456-471, 16p

Subject Terms: DYNAMIC programming, POLYNOMIAL time algorithms, COMPUTER scheduling, ALGORITHMS

Two-agent scheduling in a two-machine open shop.

Authors: Liu, Peihai Gu, Manzhan Lu, Xiwen

Source: Annals of Operations Research; Feb2024, Vol. 333 Issue 1, p275-301, 27p

Subject Terms: RETAIL store openings, APPROXIMATION algorithms, SCHEDULING, PRODUCTION scheduling, INDEPENDENT sets

Two‐agent scheduling with linear resource‐dependent processing times.

Authors: Wang, Dujuan Yu, Yugang Qiu, Huaxin et al.

Source: Naval Research Logistics; Oct2020, Vol. 67 Issue 7, p573-591, 19p

Subject Terms: TABU search algorithm, POLYNOMIAL time algorithms, POLYNOMIAL approximation, HEURISTIC algorithms, APPROXIMATION algorithms

Due date assignment and scheduling on a single machine with two competing agents.

Authors: Wang, Du-Juan Yin, Yunqiang Cheng, Shuenn-Ren et al.

Source: International Journal of Production Research; Feb2016, Vol. 54 Issue 4, p1152-1169, 18p

Subject Terms: PRODUCTION scheduling, MATHEMATICAL optimization, DYNAMIC programming, MATHEMATICAL programming, APPROXIMATION theory, PRODUCTION control

Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work.

Authors: Guo, Shuen Lu, Lingfa Yuan, Jinjiang et al.

Source: Naval Research Logistics; Aug2022, Vol. 69 Issue 5, p816-837, 22p

Subject Terms: POLYNOMIAL time algorithms, COMPUTATIONAL complexity, NP-hard problems, DYNAMIC programming, WORKING hours

Two-agent scheduling to minimize the total cost

Authors: Nong, Q.Q. Cheng, T.C.E. Ng, C.T.

Source: European Journal of Operational Research. Nov2011, Vol. 215 Issue 1, p39-44. 6p.

Subject Terms: *SCHEDULING, *COST control, *JOB analysis, *APPROXIMATION theory, *ALGORITHMS, MULTIAGENT systems, POLYNOMIALS, NP-complete problems

Scheduling of Jobs with Multiple Weights on a Single Machine for Minimizing the Total Weighted Number of Tardy Jobs.

Authors: Guo, Shuen Lang, Hao Zhang, Hanxiang

Source: Mathematics (2227-7390); Feb2023, Vol. 11 Issue 4, p1013, 19p

Subject Terms: SCHEDULING, MACHINERY, ONLINE algorithms

Single‐machine scheduling with deadlines to minimize the total weighted late work.

Authors: Chen, Rubing Yuan, Jinjiang Ng, C.T. et al.

Source: Naval Research Logistics; Oct2019, Vol. 66 Issue 7, p582-595, 14p

Subject Terms: DEADLINES, SCHEDULING, WORKING hours, APPROXIMATION algorithms

Approximation schemes for two-machine flow shop scheduling with two agents.

Authors: Luo, Wenchang Chen, Lin Zhang, Guochuan

Source: Journal of Combinatorial Optimization; Oct2012, Vol. 24 Issue 3, p229-239, 11p

Proportionate Flow Shop Scheduling with Multi-agents to Maximize Total Gains of JIT Jobs.

Authors: Li, Shi-Sheng Chen, Ren-Xia Li, Wen-Jie

Source: Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. ); Feb2018, Vol. 43 Issue 2, p969-978, 10p

Subject Terms: FLOW shop scheduling, MULTIAGENT systems, ARTIFICIAL intelligence

Due date assignment and two-agent scheduling under multitasking environment.

Authors: Yang, Yongjian Yin, Guangqiang Wang, Chunyu et al.

Source: Journal of Combinatorial Optimization; Nov2022, Vol. 44 Issue 4, p2207-2223, 17p

Minimizing maximum delivery completion time for order scheduling with rejection.

Authors: Chen, Ren-Xia Li, Shi-Sheng

Source: Journal of Combinatorial Optimization; Nov2020, Vol. 40 Issue 4, p1044-1064, 21p