Bounded serial-batching scheduling for minimizing maximum lateness and makespan

Published 2015 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Bounded serial-batching scheduling for minimizing maximum lateness and makespan
Authors
Keywords
Bicriteria scheduling, Serial-batching machine, Bounded, Makespan, Maximum lateness, Pareto optimal solutions
Journal
Discrete Optimization
Volume 16, Issue -, Pages 70-75
Publisher
Elsevier BV
Online
2015-02-25
DOI
10.1016/j.disopt.2015.02.001

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.