Toward an Efficient Resolution for a Single-machine Bi-objective Scheduling Problem with Rejection Cover

.blurhash-client-img { display: none !important; }

Toward an Efficient Resolution for a Single-machine Bi-objective Scheduling Problem with Rejection

Foundations of Computing and Decision Sciences

Volume 44 (2019): Issue 2 (June 2019)

By: Atefeh Moghaddam, Jacques Teghem, Daniel Tuyttens, Farouk Yalaoui and Lionel Amodeo

Open Access

|Jun 2019

Authors

Atefeh Moghaddam

atefeh.moghaddam@gmail.com

Chatillon, France

Jacques Teghem

jacques.teghem@umons.ac.be

Mathematics and Operational Research Unit, University of Mons, Polytechnic Faculty, Belgium

Daniel Tuyttens

daniel.tuyttens@umons.ac.be

Mathematics and Operational Research Unit, University of Mons, Polytechnic Faculty, Belgium

Farouk Yalaoui

farouk.yalaoui@utt.fr

Charles Delaunay Institute (ICD-LOSI), University of Technology of Troyes, France

Lionel Amodeo

lionel.amodeo@utt.fr

Charles Delaunay Institute (ICD-LOSI), University of Technology of Troyes, France

DOI: https://doi.org/10.2478/fcds-2019-0010 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356

Journal RSS Feed

Language: English

Page range: 179 - 211

Submitted on: Oct 4, 2018

Accepted on: Nov 13, 2018

Published on: Jun 6, 2019

Published by: Poznan University of Technology

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

Production scheduling,

bi-objective optimization,

single-machine,

Related subjects:

Computer sciences,

Artificial intelligence,

Software development

© 2019 Atefeh Moghaddam, Jacques Teghem, Daniel Tuyttens, Farouk Yalaoui, Lionel Amodeo, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous article Volume 44 (2019): Issue 2 (June 2019)Next article