<abstract xmlns="http://www.w3.org/1999/xhtml"><p>We consider a single-machine bi-objective scheduling problem with rejection. In this problem, it is possible to reject some jobs. Four algorithms are provided to solve this scheduling problem. The two objectives are the total weighted completion time and the total rejection cost. The aim is to determine the set of efficient solutions. Four heuristics are described; they are implicit enumeration algorithms forming a branching tree, each one having two versions according to the root of the tree corresponding either to acceptance or rejection of all the jobs. The algorithms are first illustrated by a didactic example. Then they are compared on a large set of instances of various dimension and their respective performances are analysed.</p></abstract>

We consider a single-machine bi-objective scheduling problem with rejection. In this problem, it is possible to reject some jobs. Four algorithms are provided to solve this scheduling problem. The two objectives are the total weighted completion time and the total rejection cost. The aim is to determine the set of efficient solutions. Four heuristics are described; they are implicit enumeration algorithms forming a branching tree, each one having two versions according to the root of the tree corresponding either to acceptance or rejection of all the jobs. The algorithms are first illustrated by a didactic example. Then they are compared on a large set of instances of various dimension and their respective performances are analysed.

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

Foundations of Computing and Decision Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

We consider a single-machine bi-objective scheduling problem with rejection. In this problem, it is possible to reject some jobs. Four algorithms are provided...

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

Online veröffentlicht: 06. Juni 2019

Seitenbereich: 179 - 211

Eingereicht: 04. Okt. 2018

Akzeptiert: 13. Nov. 2018

DOI: https://doi.org/10.2478/fcds-2019-0010

Schlüsselwörter
Production scheduling, bi-objective optimization, single-machine, rejection cost

© 2019 Atefeh Moghaddam et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Online veröffentlicht: 06. Juni 2019

Seitenbereich: 179 - 211

Eingereicht: 04. Okt. 2018

Akzeptiert: 13. Nov. 2018

DOI: https://doi.org/10.2478/fcds-2019-0010

SchlüsselwörterProduction scheduling, bi-objective optimization, single-machine, rejection cost

© 2019 Atefeh Moghaddam et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
Production scheduling, bi-objective optimization, single-machine, rejection cost