New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs

Published 2009 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
Authors
Keywords
-
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 201, Issue 1, Pages 89-98
Publisher
Elsevier BV
Online
2009-02-22
DOI
10.1016/j.ejor.2009.02.014

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

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

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.