Two-machine job shop problem under availability constraints on one machine: Makespan minimization

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Two-machine job shop problem under availability constraints on one machine: Makespan minimization
Authors
Keywords
Scheduling problem, Job shop, Availability constraint, Makespan, Mixed integer linear programming, Branch-and-bound
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 117, Issue -, Pages 138-151
Publisher
Elsevier BV
Online
2018-02-02
DOI
10.1016/j.cie.2018.01.028

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

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

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.