A note on unbounded parallel-batch scheduling

Authors

Keywords

Analysis of algorithm, Parallel-batch scheduling, Maximum cost, Strongly polynomial time, Pareto optimization

Journal

INFORMATION PROCESSING LETTERS

Volume 115, Issue 12, Pages 969-974

Publisher

Elsevier BV

Online

2015-07-08

DOI

10.1016/j.ipl.2015.07.002

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now