Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
DOI10.1016/0377-2217(84)90105-XzbMATH Open0535.90045OpenAlexW2091951427MaRDI QIDQ791440FDOQ791440
Authors: Roman Słowiński 
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90105-x
Recommendations
- Scheduling jobs to minimize total cost
- Parallel machine scheduling with a convex resource consumption function
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Rational preemptive scheduling
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
makespanpolynomial timetraveling salesmanrenewable resourcesunrelated parallel machinesparametric linear programmingtwo-stage algorithmfinancial constraintsindependent preemptable jobsone nonrenewable resourcetotal costs
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling subject to nonrenewable-resource constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- Title not available (Why is that?)
- Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
- Title not available (Why is that?)
Cited In (28)
- Approximability of scheduling problems with resource consuming jobs
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- A multivariate complexity analysis of the material consumption scheduling problem
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Single machine scheduling problems with financial resource constraints: some complexity results and properties
- Scheduling with non-renewable resources: minimizing the sum of completion times
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Stochastic scheduling to minimize expected maximum lateness
- Optimal resource profiles for program scheduling
- Algorithms – ESA 2005
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- Preemptive scheduling with staircase and piecewise linear resource availability
- Preemptive repayment policy for multiple loans
- Scheduling jobs to minimize total cost
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
- Precedence constrained parallel-machine scheduling of position-dependent jobs
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Lower bounds for the event scheduling problem with consumption and production of resources
- Scheduling unit-time tasks in renewable resource constrained flowshops
- Production scheduling problems in a textile industry
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Minimizing makespan on a single machine with release dates and inventory constraints
- Mathematical Modeling of Scheduling Problems
This page was built for publication: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q791440)
