On a methodology for discrete-continuous scheduling
From MaRDI portal
Publication:1296092
DOI10.1016/S0377-2217(97)00346-9zbMath0943.90033MaRDI QIDQ1296092
Joanna Józefowska, Jan Weglarz
Publication date: 11 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Scheduling shared continuous resources on many-cores ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Scheduling of network tasks to minimize the consumed energy ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Discrete-continuous project scheduling with discounted cash flows - a tabu search approach ⋮ Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation ⋮ Scheduling malleable tasks with interdependent processing rates: comments and observations ⋮ Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms ⋮ Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan ⋮ Revenue sharing for resource transfer among projects ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results ⋮ Discrete-continuous scheduling problems -- mean completion time results ⋮ Resource level minimization in the discrete-continuous scheduling ⋮ Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs ⋮ A priority-rule method for project scheduling with work-content constraints ⋮ Local search metaheuristics for discrete-continuous scheduling problems ⋮ A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan ⋮ Tabu list management methods for a discrete-continuous scheduling problem ⋮ Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation
Cites Work
- Unnamed Item
- Local search metaheuristics for discrete-continuous scheduling problems
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Dynamic space-sharing in computer systems
- Bounds on Multiprocessing Timing Anomalies
