Resource level minimization in the discrete-continuous scheduling
From MaRDI portal
Recommendations
- On a methodology for discrete-continuous scheduling
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Minimization of mean flow time for some discrete-continuous scheduling problems
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- scientific article; zbMATH DE number 955199
Cites work
- scientific article; zbMATH DE number 1998807 (Why is no real title available?)
- scientific article; zbMATH DE number 1998808 (Why is no real title available?)
- scientific article; zbMATH DE number 3805259 (Why is no real title available?)
- scientific article; zbMATH DE number 2123343 (Why is no real title available?)
- scientific article; zbMATH DE number 3388490 (Why is no real title available?)
- Discrete-continuous scheduling problems -- mean completion time results
- Local search metaheuristics for discrete-continuous scheduling problems
- Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
- On a methodology for discrete-continuous scheduling
- Optimal control policies for resource allocation in an activity network
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Project Scheduling with Discrete and Continuous Resources
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Tabu list management methods for a discrete-continuous scheduling problem
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
Cited in
(18)- Approximation algorithms for some discrete-continuous scheduling problems
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
- Probabilistic tabu search for makespan minimization discrete-continuous scheduling
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- On a certain class of power- and energy-related scheduling problems
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Resource leveling in a machine environment
- Scheduling shared continuous resources on many-cores
- scientific article; zbMATH DE number 955199 (Why is no real title available?)
- Structure vs. efficiency of the cross-entropy based population learning algorithm for discrete-continuous scheduling with continuous resource discretisation
- Single-machine group scheduling with deteriorating jobs and allotted resource
- Approximating the discrete resource sharing scheduling problem
- Optimizing resource speed for two-stage real-time tasks
- Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- A unified view of parallel machine scheduling with interdependent processing rates
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
This page was built for publication: Resource level minimization in the discrete-continuous scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043331)
