A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

Published 2009 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
Authors
Keywords
-
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 37, Issue 5, Pages 938-949
Publisher
Elsevier BV
Online
2009-08-11
DOI
10.1016/j.cor.2009.07.006

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

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.