Dynamic rescheduling in energy-aware unrelated parallel machine problems

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Advance in applied scheduling is a source of innovation in the manufacturing field, where new results help industrial practitioners in production management. The literature of rescheduling problems for single-objective optimization is well study, while there is a lack of extensive studies for the case of rescheduling for multi-objective optimization, especially for energy aware scheduling. This paper extends a previous work over an energy aware scheduling problem, modelled from a real industrial case study, extending its manufacturing environment to a dynamic one. To this end, two rescheduling techniques are developed to tackle machines disruptions (greedy-heuristic and meta-heuristic). They are compared to existing approach thought manufacturing environment simulations. The results give insight to improve the production management in terms of rescheduling quality and computational time.

Cite

CITATION STYLE

APA

Ferrer, S., Nicolò, G., Salido, M. A., Giret, A., & Barber, F. (2018). Dynamic rescheduling in energy-aware unrelated parallel machine problems. In IFIP Advances in Information and Communication Technology (Vol. 536, pp. 232–240). Springer New York LLC. https://doi.org/10.1007/978-3-319-99707-0_29

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