Toward a Global Constraint for Minimizing the Flowtime

Camille Bonnin, Arnaud Malapert, Margaux Nattaf, Marie-Laure Espinouse

2024

Abstract

This work is a study toward a global constraint minimizing the flowtime of a single machine scheduling problem. Classical methods for filtering algorithms use a lower bound coming from the solution of a relaxation. Notably, there are several polynomial relaxations to minimize the flowtime on a single machine. A general scheme for the global constraint is proposed that allows the use of a subset of polynomial relaxations that lays the ground for more complex filtering algorithms. The filtering algorithm has a complexity of O(n· M · R), where n is the number of tasks, M is an upper bound on the time windows of these tasks, and R is the complexity of the algorithm used for solving the relaxation. The constraint has been tested on both single machine and flowshop problems. Experimental results show that the performance improvement depends on the type of problem. The number of branches reduction is promising for designing new filtering rules.

Paper Citation

in Harvard Style

Bonnin C., Malapert A., Nattaf M. and Espinouse M. (2024). Toward a Global Constraint for Minimizing the Flowtime. In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES; ISBN 978-989-758-681-1, SciTePress, pages 70-81. DOI: 10.5220/0012310200003639

in Bibtex Style

@conference{icores24,
author={Camille Bonnin and Arnaud Malapert and Margaux Nattaf and Marie-Laure Espinouse},
title={Toward a Global Constraint for Minimizing the Flowtime},
booktitle={Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES},
year={2024},
pages={70-81},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012310200003639},
isbn={978-989-758-681-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES
TI - Toward a Global Constraint for Minimizing the Flowtime
SN - 978-989-758-681-1
AU - Bonnin C.
AU - Malapert A.
AU - Nattaf M.
AU - Espinouse M.
PY - 2024
SP - 70
EP - 81
DO - 10.5220/0012310200003639
PB - SciTePress