scientific article; zbMATH DE number 3561065

zbMath0359.90031MaRDI QIDQ4131987

No author found.

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Operations research and management science (90Bxx)

Related Items (only showing first 100 items - show all)

Profile Scheduling of Opposing Forests and Level Orders ⋮ An approach to parallel algorithm design ⋮ Unnamed Item ⋮ ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING ⋮ Unnamed Item ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Revisiting multiple pattern matching algorithms for multi-core architecture ⋮ On Scheduling Policies for Streams of Structured Jobs ⋮ Unnamed Item ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Search techniques for a nonlinear multiprocessor scheduling problem ⋮ PARAdeg-processor scheduling for acyclic SWITCH-less program nets ⋮ A linear time approximation algorithm for multiprocessor scheduling ⋮ Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines ⋮ Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness ⋮ COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION ⋮ NP-Complete operations research problems and approximation algorithms ⋮ Approximation scheduling algorithms: a survey ⋮ Scheduling Opposing Forests ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Scheduling with resource management in manufacturing systems ⋮ A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations ⋮ Scheduling tasks on two processors with deadlines and additional resources ⋮ Self-learning genetic algorithm ⋮ 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 ⋮ An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration ⋮ Multiprocessor scheduling with interprocessor communication delays ⋮ Converging to periodic schedules for cyclic scheduling problems with resources and deadlines ⋮ Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors ⋮ New trends in machine scheduling ⋮ 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 ⋮ Single machine flow-time scheduling with a single breakdown ⋮ Asymptotic optimality of statistical multiplexing in pipelined processing ⋮ Scheduling tree-structured tasks with restricted execution times ⋮ Reconstructing binary matrices with timetabling constraints ⋮ Real-time scheduling of an automated manufacturing center ⋮ Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams ⋮ On a scheduling problem in a robotized analytical system ⋮ Single processor scheduling with job values depending on their completion times ⋮ 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 ⋮ Scheduling parallel batch jobs in grids with evolutionary metaheuristics ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ On the measurement of complexity in activity networks ⋮ Dominance rules in combinatorial optimization problems ⋮ GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs ⋮ A linear-time recognition algorithm for interval dags ⋮ Lower-bound complexity algorithm for task scheduling on heterogeneous grid ⋮ A note on preemptive scheduling of periodic, real-time tasks ⋮ On the complexity of scheduling jobs on dedicated resources to minimize set-up costs ⋮ Augmented neural networks for task scheduling. ⋮ Job-shop scheduling with processing alternatives. ⋮ Methods and means of parallel processing of information ⋮ The complexity of a multiprocessor task assignment problem without deadlines ⋮ 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 ⋮ Job oriented production scheduling ⋮ Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem ⋮ Scheduling methods for a class of flexible manufacturing systems ⋮ Multi-level production scheduling for a class of flexible machining and assembly systems ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ The application of discrete programming to the design of delivery systems in large agglomerations ⋮ Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ Equivalence of mean flow time problems and mean absolute deviation problems ⋮ On optimal lateness and tardiness scheduling in real-time systems ⋮ Combinatorial optimization algorithms combining greedy strategies with a limited search procedure ⋮ A parallel algorithm for solving the inverse scattering moment problem ⋮ An algorithm for flow time minimization and its asymptotic makespan properties ⋮ Performance bounds on multiprocessor scheduling strategies for statically allocated programs ⋮ Parallel hybrid heuristics for the permutation flow shop problem ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling ⋮ Minimizing total weighted flow time of a set of jobs with interval processing times ⋮ 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 ⋮ A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ Resource constrained scheduling as generalized bin packing ⋮ Deadline scheduling of tasks with ready times and resource constraints ⋮ 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 ⋮ Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness ⋮ 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 ⋮ Distribution-free bounds on the expectation of the maximum with scheduling applications ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Models of central capacity and concurrency ⋮ Real time task scheduling allowing fuzzy due dates ⋮ Scheduling multiprocessor tasks -- An overview

This page was built for publication: