Parallel machine scheduling with a convex resource consumption function

DOI10.1016/j.ejor.2004.12.008zbMath1125.90023OpenAlexW2047395943MaRDI QIDQ2491771

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

zbMATH Keywords

computational complexityschedulingresource allocationparallel machine schedulingequivalent load method

Mathematics Subject Classification ID

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

Related Items (23)

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

Cites Work

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

This page was built for publication: Parallel machine scheduling with a convex resource consumption function