Scheduling Multiprocessor Tasks to Minimize Schedule Length
From MaRDI portal
Publication:3741047
DOI10.1109/TC.1986.1676781zbMath0604.68040OpenAlexW2101848567MaRDI QIDQ3741047
Jan Weglarz, Jacek Błażewicz, M. Drabowski
Publication date: 1986
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1986.1676781
algorithmslinear programmingdeterministic schedulingcomplex analysismicroprocessor systemnon- preemptive scheduling
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Minimizing mean flow time with parallel processors and resource constraints, A note on scheduling multiprocessor tasks with precedence constraints on parallel processors, Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications, Online scheduling of two type parallel jobs on identical machines, Complexity of scheduling multiprocessor tasks with prespecified processors allocations, Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms, Real-time scheduling of linear speedup parallel tasks, Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion, Efficiency and effectiveness of normal schedules on three dedicated processors, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, New trends in machine scheduling, The complexity of scheduling independent two-processor tasks on dedicated processors, Distributed processing of divisible jobs with communication startup costs, Models and complexity of multibin packing problems, A simple linear time approximation algorithm for multi-processor job scheduling on four processors, Deadline scheduling of multiprocessor tasks, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, On the complexity of adjacent resource scheduling, Scheduling parallel jobs to minimize the makespan, On-line scheduling of parallel jobs, Scheduling multiprocessor tasks on parallel processors with limited availability., Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., Optimal workforce assignment to operations of a paced assembly line, Scheduling chained multiprocessor tasks onto large multiprocessor system, Hybrid flow-shop scheduling problems with multiprocessor task systems., An effective approximation algorithm for the malleable parallel task scheduling problem, Production scheduling problems in a textile industry, Scheduling multiprocessor tasks on three dedicated processors, The complexity of path coloring and call scheduling, On-line scheduling of parallel jobs with runtime restrictions, Shared processor scheduling of multiprocessor jobs, Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness, Bounding the Running Time of Algorithms for Scheduling and Packing Problems, Scheduling DAGs with random parallel tasks on binarily partitionable systems, An efficient load distribution strategy for a distributed linear network of processors with communication delays, Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness, Scheduling of resource tasks, Scheduling independent two processor tasks on a uniform duo-processor system, List scheduling of parallel tasks, Scheduling multiprocessor tasks -- An overview, Scheduling multiprocessor tasks with chain constraints, Minimizing the schedule length for a parallel 3D-grid precedence graph, Scheduling multiprocessor UET tasks of two sizes, Packing-based branch-and-bound for discrete malleable task scheduling, Linear and quadratic algorithms for scheduling chains and opposite chains, An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems, Scheduling multiprocessor tasks on two parallel processors
