Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm

Published 2011 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
Authors
Keywords
-
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 40, Issue 6, Pages 1625-1647
Publisher
Elsevier BV
Online
2011-08-21
DOI
10.1016/j.cor.2011.08.009

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

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.