scientific article; zbMATH DE number 3561065
From MaRDI portal
Publication:4131987
zbMATH Open0359.90031MaRDI QIDQ4131987FDOQ4131987
Authors:
Publication date: 1976
Title of this publication is not available (Why is that?)
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)
- Performance bounds on multiprocessor scheduling strategies for statically allocated programs
- A linear-time recognition algorithm for interval dags
- On optimal lateness and tardiness scheduling in real-time systems
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- The complexity of multidimensional periodic scheduling
- On the measurement of complexity in activity networks
- A review of TSP based approaches for flowshop scheduling
- A note on preemptive scheduling of periodic, real-time tasks
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Scheduling Opposing Forests
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Scheduling tasks on two processors with deadlines and additional resources
- A state-of-the-art review of parallel-machine scheduling research
- 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
- Self-learning genetic algorithm
- Mathematical programming formulations for machine scheduling: A survey
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- Augmented neural networks for task scheduling.
- A trichotomy: Interactions of factors prolonging sequential and concurrent mental processes in stochastic discrete mental (PERT) networks
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
- Convergence of optimal stochastic bin packing
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
- Job oriented production scheduling
- Single machine flow-time scheduling with a single breakdown
- Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams
- On the complexity of locating linear facilities in the plane
- Games against nature
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Title not available (Why is that?)
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Resource constrained scheduling as generalized bin packing
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- Profile Scheduling of Opposing Forests and Level Orders
- Job-shop scheduling with processing alternatives.
- Scheduling independent 2-processor tasks to minimize schedule length
- Converging to periodic schedules for cyclic scheduling problems with resources and deadlines
- New trends in machine scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Models of central capacity and concurrency
- Real-time scheduling of an automated manufacturing center
- Scheduling parallel batch jobs in grids with evolutionary metaheuristics
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
- On a scheduling problem in a robotized analytical system
- The job shop scheduling problem: Conventional and new solution techniques
- Distributed processing of divisible jobs with communication startup costs
- Scheduling with resource management in manufacturing systems
- Dominance rules in combinatorial optimization problems
- Reconstructing binary matrices with timetabling constraints
- Single processor scheduling with job values depending on their completion times
- Minimizing total weighted flow time of a set of jobs with interval processing times
- UET scheduling with unit interprocessor communication delays
- Multi-level production scheduling for a class of flexible machining and assembly systems
- Scheduling methods for a class of flexible manufacturing systems
- New directions in scheduling theory
- Preemptive scheduling with variable profile, precedence constraints and due dates
- A new heuristic for the n-job, M-machine flow-shop problem
- A tabu search approach for the flow shop scheduling problem
- Distribution-free bounds on the expectation of the maximum with scheduling applications
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Multiprocessor scheduling with interprocessor communication delays
- Constructing a fuzzy flow-shop sequencing model based on statistical data
- Complexity of fragmentable object bin packing and an application
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
- Algorithms of distributed task allocation for cooperative agents
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Two simulated annealing-based heuristics for the job shop scheduling problem
- A lower bound for the job insertion problem.
- Approximate algorithms for the travelling purchaser problem
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals
- Multiple and bicriteria scheduling: A literature survey
- Real-time task scheduling with fuzzy deadlines and processing times
- Revisiting multiple pattern matching algorithms for multi-core architecture
- Approximation scheduling algorithms: a survey
- Linear and quadratic algorithms for scheduling chains and opposite chains
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- Scheduling with semaphore constraints
- The GST load balancing algorithm for parallel and distributed systems
- An approach to parallel algorithm design
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- Search techniques for a nonlinear multiprocessor scheduling problem
- A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
- Scheduling tree-structured tasks with restricted execution times
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION
- Real time task scheduling allowing fuzzy due dates
- ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING
- Jitter minimization in scheduling computations in real-time systems
- On-line scheduling of multi-core processor tasks with virtualization
- List scheduling in the presence of branches. A theoretical evaluation
- Parallel hybrid heuristics for the permutation flow shop problem
- List scheduling bounds for UET systems with resources
- Asymptotic optimality of statistical multiplexing in pipelined processing
- On the complexity of scheduling jobs on dedicated resources to minimize set-up costs
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)