Parallel Machine Scheduling With Minimum Number Of Tardy Jobs: Approximation And Exponential Algorithms

Federico Della Croce,Vincent T'Kindt,Olivier Ploton

APPLIED MATHEMATICS AND COMPUTATION（2021）

引用 4|浏览1

暂无评分

摘要

We consider the solution of some NP-hard parallel machine scheduling problems involving the minimization of the weighted or unweighted number of tardy jobs. We first show that these problems cannot be approximated in polynomial time. Then we propose exponential-time approximation algorithms and fixed parameter tractable exact algorithms to solve them. (C) 2020 Published by Elsevier Inc.

查看译文

关键词

Number of tardy jobs, Identical parallel machines scheduling, Exponential time approximation

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要