This study is concerned with the problem of finding an optimal sequence that minimises the weighted sum of a quadratic function of job lateness on a single machine where an idle time is allowed to be inserted only before the processing of the first job begins. We first prove that the solution...

This paper addresses multi-objective (MO) optimization of a single-model assembly line balancing problem (ALBP) where the operation times of tasks are unknown variables and the only known information is the lower and upper bounds for operation time of each task. Three objectives are...

In this paper, we analyse the single machine maximum lateness minimisation scheduling problem with the aging effect, where the job processing times are described by non-decreasing functions dependent on the sum of the normal processing times of already processed jobs. We prove that the...

This paper considers as single machine scheduling problem in which jobs have due dates and deadlines. A job may be completed after its due date, but not after its deadline, in which case it is tardy. A branch and bound algorithm is proposed to find a schedule which minimizes the weighted number...