On a methodology for discrete-continuous scheduling
From MaRDI portal
Publication:1296092
DOI10.1016/S0377-2217(97)00346-9zbMATH Open0943.90033MaRDI QIDQ1296092FDOQ1296092
Authors: Joanna Józefowska, Jan Węglarz 
Publication date: 11 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- scientific article; zbMATH DE number 1281666
- Discrete-continuous scheduling problems -- mean completion time results
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
Cites Work
- Bounds on Multiprocessing Timing Anomalies
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Title not available (Why is that?)
- Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Dynamic space-sharing in computer systems
- Local search metaheuristics for discrete-continuous scheduling problems
Cited In (28)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Local search metaheuristics for discrete-continuous scheduling problems
- A unified view of parallel machine scheduling with interdependent processing rates
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Title not available (Why is that?)
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
- Tabu list management methods for a discrete-continuous scheduling problem
- Probabilistic tabu search for makespan minimization discrete-continuous scheduling
- Scheduling of network tasks to minimize the consumed energy
- Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
- A priority-rule method for project scheduling with work-content constraints
- Revenue sharing for resource transfer among projects
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Optimal scheduling of parallel machines with constrained resources
- Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
- Title not available (Why is that?)
- Scheduling shared continuous resources on many-cores
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Resource level minimization in the discrete-continuous scheduling
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
- Scheduling malleable tasks with interdependent processing rates: comments and observations
- On the continuous working problem
- Discrete-continuous scheduling problems -- mean completion time results
- Approximation algorithms for some discrete-continuous scheduling problems
- Structure vs. efficiency of the cross-entropy based population learning algorithm for discrete-continuous scheduling with continuous resource discretisation
This page was built for publication: On a methodology for discrete-continuous scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296092)
