Scheduling simultaneous resources: A case study on a calibration laboratory

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A calibration laboratory studied in this research performs a thermal test that requires an analyst for setup and processing and an oven to perform such an essay. For convenience, it’s possible to group some of the essays according to the oven capacity. In this scenario, this paper proposes a scheduling approach to minimize the total flowtime of the orders. This is a multiple resource scheduling problem, where a resource (operator) is used on two processes (oven setup and analysis). In contrast to the classical definition of multiple resource scheduling problems, the oven setup process requires the presence of the operator only for the startup of the process. To solve this problem, we derived: (i) a mixed-integer formulation; (ii) an Ant Colony Optimization (ACO) approach. On those developments, we also discuss some structural properties of this problem, that may lead to further advances in this field in the future. Our results show the ACO approach as a good alternative to the MIP, especially when solving instances with 30 service orders.

Cite

CITATION STYLE

APA

Tavares Neto, R., & Molina da Silva, F. (2019). Scheduling simultaneous resources: A case study on a calibration laboratory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11299 LNCS, pp. 150–163). Springer Verlag. https://doi.org/10.1007/978-3-030-05983-5_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free