This paper deals with the problem of processing a set of n jobs on two identical parallel
machines. In order to reduce the probability of machine breakdown with minor sacrifices in …

The previous studies on scheduling problem with tool changes take processing time as the
only reason for the tool wear, which is not accurate in the real manufacturing system. This …

This research focuses on the problem of scheduling jobs on a single machine that requires
periodic maintenance with the objective of minimizing the number of tardy jobs. We present …

A problem of jointly scheduling multiple jobs and a single maintenance activity on a single
machine with the objective of minimizing total completion time is considered in this paper. It …

Scheduling with multiple agents has been widely studied. However, a little work has been
done on multi-agent scheduling with availability constraints. This paper addresses a two …

A single-machine scheduling problem with workload-dependent maintenance duration is
considered. The objective is to minimize total completion time. For the case where the …

This paper deals with the problem of scheduling a single machine with periodic
maintenance, where the machine is assumed to be stopped periodically to be maintained or …

In this paper, the identical parallel machine scheduling problem with periodic tool changes
due to wear is addressed under the total completion time minimization objective. Due to …

The majority of machine scheduling literature assumes that machines are available at all
times. However, this assumption is inappropriate in certain real world situations. This study …

A two-parallel-machine scheduling problem with machine-dependent availabilities where
one machine is subject to tool changes and the other is subject to periodic maintenance is …