Parallel machine scheduling with a convex resource consumption function
From MaRDI portal
Recommendations
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Just-in-time scheduling with controllable processing times on parallel machines
- Simultaneous job scheduling and resource allocation on parallel machines
Cites work
- scientific article; zbMATH DE number 4035555 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A bicriterion approach to time/cost trade-offs in sequencing
- A multi-objective approach to resource allocation in single machine scheduling
- A permutation flow-shop scheduling problem with convex models of operation processing times
- Allocation of resources in project management
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- Job-shop scheduling with convex models of operations
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- Minimization of the makespan in a two-machine problem under given resource constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with deadlines and loss functions
- Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
- Single machine batch scheduling with deadlines and resource dependent processing times
- Single machine scheduling problem with a common deadline and resource dependent release dates
- Single machine scheduling subject to deadlines and resource dependent processing times
- Solving a class of two-resource allocation problem by equivalent load method
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
Cited in
(29)- Power-aware scheduling for makespan and flow
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
- scientific article; zbMATH DE number 1786151 (Why is no real title available?)
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Minimizing total completion time in multiprocessor job systems with energy constraint
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
- Convex programming for scheduling unrelated parallel machines
- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II
- A survey of scheduling with controllable processing times
- A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Scheduling parallel CNC machines with time/cost trade-off considerations
- Scheduling parallel dedicated machines with the speeding-up resource
- Scheduling a batching machine with convex resource consumption functions
- Simultaneous job scheduling and resource allocation on parallel machines
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- A unified view of parallel machine scheduling with interdependent processing rates
- Multi-core processor scheduling with respect to data bus bandwidth
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- Two-machine flow shop scheduling with convex resource consumption functions
This page was built for publication: Parallel machine scheduling with a convex resource consumption function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491771)
