Time-optimal control in a single machine problem with resource constraints
Automatica (Journal of IFAC)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Information Processing Letters
A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Mathematics of Operations Research
Production and Operations Management
Production and Operations Management
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard
Information Processing Letters
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
SIAM Journal on Optimization
Single machine scheduling with a variable common due date and resource-dependent processing times
Computers and Operations Research
Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times
Computers and Operations Research
Pre-Emptive Scheduling Problems with Controllable Processing Times
Journal of Scheduling
Single machine scheduling with controllable release and processing parameters
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Scheduling parallel CNC machines with time/cost trade-off considerations
Computers and Operations Research
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Manufacturing & Service Operations Management
Single machine scheduling with discretely controllable processing times
Operations Research Letters
Two-machine flowshop scheduling with flexible operations and controllable processing times
Computers and Operations Research
Hi-index | 0.04 |
We extend the classical linear assignment problem to the case where the cost of assigning agent j to task i is a multiplication of task i's cost parameter by a cost function of agent j. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second is the total weighted resource consumption. We address these criteria via four different problem variations. We prove that our assignment problem is NP-hard for three of the four variations, even if all the resource consumption weights are equal. However, and somewhat surprisingly, we find that the fourth variation is solvable in polynomial time. In addition, we find that our assignment problem is equivalent to a large set of important scheduling problems whose complexity has been an open question until now, for three of the four variations.