A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job

Published 2015 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Authors
Keywords
Mixed-shop scheduling, Polynomial-time algorithms, Preemption
Journal
JOURNAL OF SCHEDULING
Volume 19, Issue 1, Pages 61-72
Publisher
Springer Nature
Online
2015-09-28
DOI
10.1007/s10951-015-0454-9
References
View 1 related references

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.