Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
From MaRDI portal
Publication:791440
DOI10.1016/0377-2217(84)90105-XzbMath0535.90045OpenAlexW2091951427MaRDI QIDQ791440
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
traveling salesmanmakespanunrelated parallel machinespolynomial timerenewable resourcesparametric linear programmingtwo-stage algorithmfinancial constraintsindependent preemptable jobsone nonrenewable resourcetotal costs
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items
Polynomial algorithms for single machine scheduling problems with financial constraints, 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, Approximation schemes for single machine scheduling with non-renewable resource constraints, Lower bounds for the event scheduling problem with consumption and production of resources, Scheduling unit-time tasks in renewable resource constrained flowshops, A multivariate complexity analysis of the material consumption scheduling problem, Approximation schemes for parallel machine scheduling with non-renewable resources, A PTAS for a resource scheduling problem with arbitrary number of parallel machines, Reductions between scheduling problems with non-renewable resources and knapsack problems, Production scheduling problems in a textile industry, Preemptive scheduling with staircase and piecewise linear resource availability, Stochastic scheduling to minimize expected maximum lateness, Single machine scheduling problems with financial resource constraints: some complexity results and properties, EPTAS for load balancing problem on parallel machines with a non-renewable resource, Mathematical Modeling of Scheduling Problems, Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry, Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints, A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource, Optimal resource profiles for program scheduling, New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints, EPTAS for load balancing problem on parallel machines with a non-renewable resource, Approximability of scheduling problems with resource consuming jobs
Cites Work
- Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
- Scheduling subject to nonrenewable-resource constraints
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
