scientific article; zbMATH DE number 4199946

MaRDI QIDQ3348688zbMATH OpenFDO

Authors Li Shi

Publication date 1990

zbMATH Keywords

minimal upper boundNP-completenessschedulingtime complexity

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Algorithms for solving minimax scheduling problem
• scientific article; zbMATH DE number 784432
• The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
• Computational complexity of some scheduling problems with multiprocessor tasks
• Process scheduling in heterogeneous multiprocessor systems

Cited in

(7)

• UET-scheduling with constrained processor allocations
• An optimal scheduling algorithm for preemptable real-time tasks
• Optimal investment consumption model with a higher interest rate for borrowing
• A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces
• -optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
• Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
• Performance bounds on multiprocessor scheduling strategies for statically allocated programs

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