scientific article; zbMATH DE number 8821

DOI10.1002/1520-6750(199104)38:2%3C273::AID-NAV3220380211%3E3.0.CO;2-AMaRDI QIDQ3971305zbMATH OpenFDO

Authors James D. Blocher, Suresh Chand

Publication date 25 June 1992

Full work available at URL https://doi.org/10.1002/1520-6750(199104)38:2%3C273::AID-NAV3220380211%3E3.0.CO;2-A

zbMATH Keywords

improved lower boundlongest processing time first sequencingmakespanparallel-processor schedulingpolynomial time algorithmposterior lower boundtwo-step algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A note on the Coffman-Sethi bound for LPT scheduling
• Performance of the LPT algorithm in multiprocessor scheduling
• A note on LPT scheduling
• A note on posterior tight worst-case bounds for longest processing time schedules

Cites work

• Algorithms for Scheduling Independent Tasks
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Cited in

(9)

• A general lower bound for the makespan problem
• An LPT-bound for a parallel multiprocessor scheduling problem
• A note on the Coffman-Sethi bound for LPT scheduling
• A note on posterior tight worst-case bounds for longest processing time schedules
• A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
• scientific article; zbMATH DE number 4113979 (Why is no real title available?)
• scientific article; zbMATH DE number 1863264 (Why is no real title available?)

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