Resource level minimization in the discrete-continuous scheduling

DOI10.1016/j.ejor.2009.07.021zbMath1176.90216MaRDI 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

scheduling; discrete-continuous scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE, Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan, Single-machine group scheduling with deteriorating jobs and allotted resource

Uses Software

• NSOIA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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