Resource level minimization in the discrete-continuous scheduling

DOI10.1016/j.ejor.2009.07.021zbMath1176.90216OpenAlexW2075583204MaRDI QIDQ1043331

Adam Janiak, Mateusz Gorczyca

Publication date: 7 December 2009

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

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

zbMATH Keywords

schedulingdiscrete-continuous scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ On a certain class of power- and energy-related scheduling problems ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE ⋮ Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ A unified view of parallel machine scheduling with interdependent processing rates

Uses Software

• NSOIA

Cites Work

• Scheduling malleable tasks on parallel processors to minimize the makespan
• Optimal control policies for resource allocation in an activity network
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• Discrete-continuous scheduling problems -- mean completion time results
• On a methodology for discrete-continuous scheduling
• Local search metaheuristics for discrete-continuous scheduling problems
• Tabu list management methods for a discrete-continuous scheduling problem
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
• Project Scheduling with Discrete and Continuous Resources
• Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource level minimization in the discrete-continuous scheduling