Approximation algorithms for some position-dependent scheduling problems-Reference-Cited by-同舟云学术

Approximation algorithms for some position-dependent scheduling problems

Published:2021-01 Issue: Volume:289 Page:22-31
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Yang Liya,Lu Xiwen

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference18 articles.

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, in: 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 32–43.

2. Scheduling jobs with position-dependent processing times;Bachman;J. Oper. Res. Soc.,2004

3. Scheduling deteriorating jobs on a single processor;Browne;Oper. Res.,1990

4. Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect;Eren;Appl. Math. Comput.,2009

5. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs;Kovalyov;J. Heuristics,1998

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Solution-Based Tabu Search Algorithm for the Resource-Constrained Project Scheduling Problem with Step Deterioration;Mathematical Problems in Engineering;2023-05-10

2. A Review of Task Scheduling Problems;Proceedings of the 2nd International Academic Conference on Blockchain, Information Technology and Smart Finance (ICBIS 2023);2023

3. Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect;International Journal of Foundations of Computer Science;2022-12-31