scientific article; zbMATH DE number 3561065
From MaRDI portal
Publication:4131987
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Operations research and management science (90Bxx)
Cited in
(only showing first 100 items - show all)- First fit decreasing scheduling on uniform multiprocessors
- Convergence of optimal stochastic bin packing
- Games against nature
- Scheduling tasks on two processors with deadlines and additional resources
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Scheduling with semaphore constraints
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- UET scheduling with unit interprocessor communication delays
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals
- Multiprocessor scheduling with interprocessor communication delays
- New trends in machine scheduling
- Single machine flow-time scheduling with a single breakdown
- Scheduling tree-structured tasks with restricted execution times
- Real-time scheduling of an automated manufacturing center
- List scheduling in the presence of branches. A theoretical evaluation
- Multiple and bicriteria scheduling: A literature survey
- List scheduling bounds for UET systems with resources
- On the measurement of complexity in activity networks
- A linear-time recognition algorithm for interval dags
- A note on preemptive scheduling of periodic, real-time tasks
- On the complexity of scheduling jobs on dedicated resources to minimize set-up costs
- Methods and means of parallel processing of information
- The complexity of a multiprocessor task assignment problem without deadlines
- Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem
- The application of discrete programming to the design of delivery systems in large agglomerations
- Equivalence of mean flow time problems and mean absolute deviation problems
- On optimal lateness and tardiness scheduling in real-time systems
- A parallel algorithm for solving the inverse scattering moment problem
- An algorithm for flow time minimization and its asymptotic makespan properties
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
- Resource constrained scheduling as generalized bin packing
- Deadline scheduling of tasks with ready times and resource constraints
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- The job shop scheduling problem: Conventional and new solution techniques
- Real time task scheduling allowing fuzzy due dates
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- The complexity of multidimensional periodic scheduling
- A tabu search approach for the flow shop scheduling problem
- Scheduling with resource management in manufacturing systems
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
- Distributed processing of divisible jobs with communication startup costs
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Augmented neural networks for task scheduling.
- Job-shop scheduling with processing alternatives.
- Algorithms of distributed task allocation for cooperative agents
- Real-time task scheduling with fuzzy deadlines and processing times
- Linear and quadratic algorithms for scheduling chains and opposite chains
- Constructing a fuzzy flow-shop sequencing model based on statistical data
- The GST load balancing algorithm for parallel and distributed systems
- Complexity of fragmentable object bin packing and an application
- GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs
- Lower-bound complexity algorithm for task scheduling on heterogeneous grid
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- Parallel hybrid heuristics for the permutation flow shop problem
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Two simulated annealing-based heuristics for the job shop scheduling problem
- A lower bound for the job insertion problem.
- A trichotomy: Interactions of factors prolonging sequential and concurrent mental processes in stochastic discrete mental (PERT) networks
- Minimum-delay schedules in layered networks
- Approximate algorithms for the travelling purchaser problem
- On the complexity of locating linear facilities in the plane
- Review of properties of different precedence graphs for scheduling problems
- A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- Asymptotic optimality of statistical multiplexing in pipelined processing
- On a scheduling problem in a robotized analytical system
- Jitter minimization in scheduling computations in real-time systems
- Greed in resource scheduling
- A new heuristic for the n-job, M-machine flow-shop problem
- Revisiting multiple pattern matching algorithms for multi-core architecture
- A review of TSP based approaches for flowshop scheduling
- Self-learning genetic algorithm
- A linear time approximation algorithm for multiprocessor scheduling
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Search techniques for a nonlinear multiprocessor scheduling problem
- Converging to periodic schedules for cyclic scheduling problems with resources and deadlines
- Reconstructing binary matrices with timetabling constraints
- On Scheduling Policies for Streams of Structured Jobs
- Profile Scheduling of Opposing Forests and Level Orders
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- scientific article; zbMATH DE number 3657112 (Why is no real title available?)
- scientific article; zbMATH DE number 3742998 (Why is no real title available?)
- NP-Complete operations research problems and approximation algorithms
- Approximation scheduling algorithms: a survey
- Dominance rules in combinatorial optimization problems
- A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems
- Static heuristics for robust resource allocation of continuously executing applications
- Stochastic robustness metric and its use for static resource allocations
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
- Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines
- COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION
- Scheduling Opposing Forests
- ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING
- An approach to parallel algorithm design
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- PARAdeg-processor scheduling for acyclic SWITCH-less program nets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131987)