Multi-Objective Optimization of the Dynamic and Flexible Job Shop Scheduling Problem Under Workers Fatigue Constraints

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

Abstract

A massive number of studies has tackled the scheduling problem, but they mainly seek to solve the classic problem by reducing the real constraints of the environment like workers’ fatigue, which may lead to defective production, and the occurrence of unexpected events that makes the initial scheduling obsolete. In this paper, we study the multi-objective dynamic flexible job shop-scheduling problem under workers’ fatigue constraints (DFJSP-WF) through three unexpected events: job insertion, machine breakdown and job cancellation. First, a multi-objective model is established with objectives to minimize makespan and total weighted tardiness, earliness and rejected parts due to workers’ errors, which depend on workers’ fatigue. Second, to deal with this model, a non-dominated sorting genetic algorithm II (NSGA-II) is adapted. Computational results are presented using three sets of well-known benchmark literature instances.

Cite

CITATION STYLE

APA

Aribi, D., Driss, O. B., & El Haouzi, H. B. (2023). Multi-Objective Optimization of the Dynamic and Flexible Job Shop Scheduling Problem Under Workers Fatigue Constraints. In International Conference on Agents and Artificial Intelligence (Vol. 3, pp. 301–308). Science and Technology Publications, Lda. https://doi.org/10.5220/0011663800003393

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