Parallel machine scheduling with a convex resource consumption function

DOI10.1016/J.EJOR.2004.12.008zbMATH Open1125.90023OpenAlexW2047395943MaRDI QIDQ2491771FDOQ2491771

Authors: Dvir Shabtay, Moshe Kaspi 

Publication date: 29 May 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.12.008

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

zbMATH Keywords

computational complexityresource allocationschedulingparallel machine schedulingequivalent load method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Allocation of resources in project management
• Scheduling with deadlines and loss functions
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Single machine scheduling problem with a common deadline and resource dependent release dates
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling subject to deadlines and resource dependent processing times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• A multi-objective approach to resource allocation in single machine scheduling
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Single machine batch scheduling with deadlines and resource dependent processing times
• Title not available (Why is that?)
• Solving a class of two-resource allocation problem by equivalent load method
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Minimization of the makespan in a two-machine problem under given resource constraints
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Job-shop scheduling with convex models of operations
• A permutation flow-shop scheduling problem with convex models of operation processing times

Cited In (29)

• Two-machine flow shop scheduling with convex resource consumption functions
• Simultaneous job scheduling and resource allocation on parallel machines
• A unified view of parallel machine scheduling with interdependent processing rates
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Minimizing total completion time in multiprocessor job systems with energy constraint
• Power-aware scheduling for makespan and flow
• Title not available (Why is that?)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• 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
• Solving multi-objective parallel machine scheduling problem by a modified NSGA-II
• A survey of scheduling with controllable processing times
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Scheduling a batching machine with convex resource consumption functions
• Scheduling parallel CNC machines with time/cost trade-off considerations
• Convex programming for scheduling unrelated parallel machines
• Approximation schemes for parallel machine scheduling with non-renewable resources
• Scheduling parallel dedicated machines with the speeding-up resource
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Multi-core processor scheduling with respect to data bus bandwidth

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)