The resource dependent assignment problem with a convex agent cost function-Reference-Cited by-同舟云学术

The resource dependent assignment problem with a convex agent cost function

Published:2017-09 Issue:2 Volume:261 Page:486-502
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Yedidsion Liron^ORCID,Shabtay Dvir

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. An algorithm for the two-resource allocation problem with a non-differentiable convex objective function;Armstrong;Journal of the Operational Research Society,1995

2. Tight results for next fit and worst fit with resource augmentation;Boyar;Theoretical Computer Science,2010

3. Bicriterion single machine scheduling with resource dependent processing times;Cheng;SIAM Journal on Optimization,1998

4. Maximizing the minimum load for selfish agents;Epstein;Theoretical Computer Science,2009

5. Deep-submicron microprocessor design issues;Flynn;IEEE Micro,1999

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

1. Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments;Journal of Applied Mathematics and Computing;2024-08-14

2. Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations;Journal of Applied Mathematics and Computing;2024-03-19

3. Optimal Different Due-Date Assignment Scheduling with Group Technology and Resource Allocation;Mathematics;2024-01-29

4. Pareto Optimal Solutions of the Minimal Cost Minimal Time Assignment Problem;2023 International Conference Automatics and Informatics (ICAI);2023-10-05

5. Solving an airport ground service task assignment problem with an exact algorithm;PLOS ONE;2022-12-22