The sum of the maximum earliness and tardiness criteria is a new objective function for the
job shop scheduling problem introduced in this work. A mixed integer linear programming …

This research focuses on a scheduling problem with multiple unavailability periods and
distinct due dates. The objective is to minimize the sum of maximum earliness and tardiness …

This paper addresses the problem of minimizing the sum of maximum earliness and
tardiness on a single machine with unequal release times and idle insert as realistic …

The multi-agent scheduling with periodic maintenance concerns has received little attention
till recently. The focus of this research is on the single machine scheduling problem that the …

This study addresses the single-machine scheduling problem with a common due window
(CDW) that has a constant size and position. The objective is to minimise the total weighted …

In this paper, hybrid flowshop (HFS) scheduling problems with sequence dependent setup
times (SDST) are considered. The objective is to minimise the total tardiness. As these …

This paper addresses the scheduling of a permutation flowshop scheduling problem with
blocking constraints to minimise the total tardiness and total weighted tardiness with a …

In the past decade, multi-agent scheduling studies have become more widespread.
However, the evaluation of these issues in the flow shop scheduling environment has …

The bottleneck travelling salesman problem is to find a Hamiltonian circuit that minimises the
maximum arc length in a graph. We first modify an existing lexisearch algorithm by …

In this paper, we investigate the problem of n-jobs scheduling in an m-machine permutation
flowshop with exact time lags between consecutive operations of each job. The exact time …