scientific article; zbMATH DE number 838793

zbMATH Open0840.90091MaRDI QIDQ4863921FDOQ4863921

Alekos Triantafyiiakis, Spyros G. Tzafestas

Publication date: 12 February 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3883925
• Scheduling Tasks with AND/OR Precedence Constraints
• scientific article; zbMATH DE number 3941253
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• An approach to parallel algorithm design

zbMATH Keywords

flexible manufacturing systemparallel processorsFMSAND/OR graphs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (11)

• Concurrent operations can be parallelized in scheduling multiprocessor job shop
• Scheduling Sequential Loops on Parallel Processors
• Title not available (Why is that?)
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Title not available (Why is that?)
• Scheduling Interval Ordered Tasks in Parallel
• Performance of critical path type algorithms for scheduling on parallel processors
• Parallel execution of schedules with random dependency graph
• Title not available (Why is that?)
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation

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