In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a...

This paper is concerned with scheduling a number of jobs on multiple identical parallel machines to minimise job Completion Time Variance (CTV), which is a performance measure that emphasises providing uniform service to jobs. CTV minimisation is closely related to common due date problems,...

This paper is concerned with scheduling a number of jobs on multiple identical parallel machines to minimise job Completion Time Variance (CTV), which is a performance measure that emphasises providing uniform service to jobs. CTV minimisation is closely related to common due date problems,...

In this paper, new repair and rescheduling algorithms are developed for the unrelated parallel machine environment. The introduced rules and algorithms are used to handle different rates of breakdowns and delays and are evaluated based on several performance measures to ensure the optimisation...

In this paper, new repair and rescheduling algorithms are developed for the unrelated parallel machine environment. The introduced rules and algorithms are used to handle different rates of breakdowns and delays and are evaluated based on several performance measures to ensure the optimisation...