Minimizing total completion time in two-processor task systems with prespecified processor allocations

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199803)45:2<231::AID-NAV7>3.0.CO;2-9" /><231::AID-NAV7>3.0.CO;2-9 10.1002/(SICI)1520-6750(199803)45:2<231::AID-NAV7>3.0.CO;2-9zbMath0914.90158OpenAlexW2050331342MaRDI QIDQ4390599

Chung-Yee Lee, Chung-Lun Li, Xiaoqiang Cai

Publication date: 27 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199803)45:2<231::aid-nav7>3.0.co;2-9

zbMATH Keywords

heuristicworst-case analysistotal completion timescheduling multiprocessor tasksprespecified processor locationstwo-processor problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

On maximizing the throughput of multiprocessor tasks. ⋮ A polynomial algorithm for some preemptive multiprocessor task scheduling problems ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties ⋮ Lower bound algorithms for multiprocessor task scheduling with ready times ⋮ Minimizing total completion time in multiprocessor job systems with energy constraint

This page was built for publication: Minimizing total completion time in two-processor task systems with prespecified processor allocations