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

DOI10.1002/(SICI)1520-6750(199803)45:2%3C231::AID-NAV7%3E3.0.CO;2-9MaRDI QIDQ4390599zbMATH OpenOpenAlexFDO

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

Publication date 27 June 1999

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199803)45:2%3C231::aid-nav7%3E3.0.co;2-9

zbMATH Keywords

heuristicprespecified processor locationsscheduling multiprocessor taskstotal completion timetwo-processor problemworst-case analysis

Mathematics Subject Classification ID

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

Recommendations

• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent multiprocessor tasks
• Scheduling independent multiprocessor tasks
• Minimizing mean flow time with parallel processors and resource constraints
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390599)