‎in this paper, we study a flow shop batch processing machines scheduling problem. the fuzzy due dates are considered to make the problem more close to the reality. the objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. in order to tackle the given problem, we propose a hybrid electromagnetism-like (em) algorithm, in which the em is hybridized with a diversi...

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...

This work studies the performance of two Mixed Integer Linear Programming (MILP) models to solve scheduling problems in a flexible job shop environment with recirculation and assembly using a due-date-based objective function. The models convey different approaches both in the modelling of time (discrete and continuous approaches) as well as in the assignment of jobs to machines. The comparison...