Scheduling jobs with time-resource tradeoff via nonlinear programming
type: Item
instance of: scholarly article
title: Scheduling jobs with time-resource tradeoff via nonlinear programming
zbMATH Open document ID: 1175.90166
author: Alexander Grigoriev
author: Marc Uetz
published in: Discrete Optimization
publication date: 2009-11-23T00:00:00Z
full work available at URL: scheduling-jobs-with-timeresource-tradeoff-via-nonlinear-programming(69935b36-9311-4453-a7f6-62298f199324).html
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5637332
zbMATH Keywords: scheduling
zbMATH Keywords: mathematical programming
zbMATH Keywords: approximation algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: time-resource tradeoff
MaRDI profile type: Publication
OpenAlex ID: W2023486688
cites work: Simultaneous job scheduling and resource allocation on parallel machines
cites work: Approximation schemes for job shop scheduling problems with controllable processing times
cites work: An approximation algorithm for the generalized assignment problem
cites work: Approximation algorithms for the discrete time-cost tradeoff problem
cites work: Machine scheduling with resource dependent processing times
cites work: An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Scheduling parallel dedicated machines under a single non-shared resource
cites work: Scheduling parallel dedicated machines with the speeding‐up resource
cites work: Scheduling problems for parallel dedicated machines under multiple resource constraints.
cites work: Approximation schemes for parallel machine scheduling problems with controllable processing times
cites work: A survey of scheduling with controllable processing times
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: On the solution of concave knapsack problems
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Approximation and Online Algorithms
DOI: 10.1016/J.DISOPT.2009.05.002
description: scientific article; zbMATH DE number 5637332