Shifting bottleneck scheduling for total weighted tardiness minimization—A computational evaluation of subproblem and re-optimization heuristics

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Shifting bottleneck scheduling for total weighted tardiness minimization—A computational evaluation of subproblem and re-optimization heuristics
Authors
Keywords
Job shop scheduling, Total weighted tardiness, Shifting bottleneck procedure, Decomposition, Dominance rule, Iterated local search
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 66, Issue -, Pages 130-140
Publisher
Elsevier BV
Online
2015-08-06
DOI
10.1016/j.cor.2015.07.012

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
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.