scientific article; zbMATH DE number 3941253

MaRDI QIDQ3713850zbMATH OpenFDO

Authors S. Yu. Sher

Publication date 1981

Full work available at URL https://eudml.org/doc/69023

zbMATH Keywords

minimum number of machinesnonpreemptable independent tasksoptimal scheduleparallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 3978803
• scientific article; zbMATH DE number 4029243
• A problem in scheduling theory
• The schedule-sequencing problem
• Les problèmes d'ordonnancement
• Scheduling problems
• On approximating a scheduling problem
• scientific article; zbMATH DE number 1560337
• On one scheduling problem
• One problem of scheduling theory

Cited in

(34)

• Exact algorithms for scheduling programs with shared tasks
• Nonpreemptive scheduling of arbitrary machines
• Minimization of the number of devices under working in systems of identical parallel devices
• scientific article; zbMATH DE number 4016581 (Why is no real title available?)
• scientific article; zbMATH DE number 3883925 (Why is no real title available?)
• scientific article; zbMATH DE number 3843474 (Why is no real title available?)
• Complexity results for scheduling tasks with discrete starting times
• scientific article; zbMATH DE number 3858821 (Why is no real title available?)
• scientific article; zbMATH DE number 4201583 (Why is no real title available?)
• scientific article; zbMATH DE number 4154199 (Why is no real title available?)
• Complex Scheduling
• scientific article; zbMATH DE number 3896981 (Why is no real title available?)
• scientific article; zbMATH DE number 3914068 (Why is no real title available?)
• scientific article; zbMATH DE number 3958723 (Why is no real title available?)
• scientific article; zbMATH DE number 3978803 (Why is no real title available?)
• Rescheduling to minimize makespan on a changing number of identical processors
• A nonidentical parallel processor scheduling problem
• scientific article; zbMATH DE number 4093160 (Why is no real title available?)
• scientific article; zbMATH DE number 146431 (Why is no real title available?)
• scientific article; zbMATH DE number 1234084 (Why is no real title available?)
• New bounds on time and number of processors for multiprocessor optimal schedules
• scientific article; zbMATH DE number 1305540 (Why is no real title available?)
• An existence theorem for packing problems with implications for the computation of optimal machine schedules
• scientific article; zbMATH DE number 1884457 (Why is no real title available?)
• scientific article; zbMATH DE number 2099626 (Why is no real title available?)
• scientific article; zbMATH DE number 838793 (Why is no real title available?)
• Optimal Scheduling of Tasks on Identical Parallel Processors
• An approach to parallel algorithm design
• Mathematical module for optimal scheduling in distributed-memory machines
• Makespan of a batch of partitionable tasks
• A combinatorial problem in a multitask information server
• Graph models for scheduling systems with machine saturation property
• Sequential and parallel computations in the general scheduling problem
• A general bound on schedule length for independent tasks

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 Q3713850)