Exploring a two-criterion order scheduling problem by using five heuristics

DOI

10.2991/febm-17.2017.30How to use a DOI?

Keywords

order scheduling; particle swarm optimization; iterated greedy; total flowtime; maximum tardiness

Abstract

Recently the order scheduling (OS) problem is concerned by the research community. However, the OS study with more than one criterion is only few. In view of this limitation, we address an OS problem in which the objective is to find a schedule to minimize the sum of total flowtime and the maximum tardiness. The complexity of this problem is very difficult. Thus, we use five heuristics including three modified heuristics, an iterated greedy (IG) method, and a particle swarm colony (PSO) algorithm for finding approximately solutions. Finally, the statistical results and comparison performances of all five heuristics are reported.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Win-Chin Lin
AU  - Carol Yu
AU  - Shuenn-Ren Cheng
AU  - Tzu-Yun Lin
AU  - Yuan-Po Chao
AU  - Shang-Chia Liu
AU  - Chin-Chia Wu
PY  - 2017/10
DA  - 2017/10
TI  - Exploring a two-criterion order scheduling problem by using five heuristics
BT  - Proceedings of the Second International Conference On Economic and Business Management (FEBM 2017)
PB  - Atlantis Press
SP  - 232
EP  - 239
SN  - 2352-5428
UR  - https://doi.org/10.2991/febm-17.2017.30
DO  - 10.2991/febm-17.2017.30
ID  - Lin2017/10
ER  -