Scheduling jobs with time-resource tradeoff via nonlinear programming

DOI10.1016/j.disopt.2009.05.002zbMath1175.90166OpenAlexW2023486688MaRDI QIDQ1040086

Alexander Grigoriev, Marc Uetz

Publication date: 23 November 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/scheduling-jobs-with-timeresource-tradeoff-via-nonlinear-programming(69935b36-9311-4453-a7f6-62298f199324).html

zbMATH Keywords

computational complexityschedulingmathematical programmingapproximation algorithmstime-resource tradeoff

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Approximation of the parallel machine scheduling problem with additional unit resources ⋮ Scheduling on two identical machines with a speed-up resource ⋮ Approximation algorithms for scheduling on multi-core processor with shared speedup resources ⋮ Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Simultaneous job scheduling and resource allocation on parallel machines
• Machine scheduling with resource dependent processing times
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Scheduling subject to resource constraints: Classification and complexity
• An approximation algorithm for the generalized assignment problem
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Scheduling parallel dedicated machines under a single non-shared resource
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• On the solution of concave knapsack problems
• A survey of scheduling with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Fast Approximation Algorithms for Knapsack Problems
• Scheduling parallel dedicated machines with the speeding‐up resource
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Approximation and Online Algorithms

This page was built for publication: Scheduling jobs with time-resource tradeoff via nonlinear programming