This paper is a comprehensive review of the research conducted over the past four decades
in the domain of time-dependent scheduling, where variable processing times of jobs …

This paper presents a hybrid algorithm that integrates the project priority (or criticality) with
project schedule development for multi-project scheduling problem under resource …

We consider parallel-machine scheduling with deteriorating jobs and DeJong's learning
effect. We focus on the problems to minimize the total completion time and the makespan …

Production systems are subject to machine deterioration and resource consumption
constraints. The deterioration increases the processing time which leads to an increase in …

In this paper, we address a two-machine flow shop scheduling problem under simple linear
deterioration. By a simple linear deterioration function, we mean that the processing time of …

Sažetak This paper presents a hybrid genetic algorithm for assembly flow-shop scheduling
problem with sequence-dependent setup and transportation times, with objectives, namely …

This paper considers a single-machine scheduling problem to minimize the total weighted
completion time with a weight modifying activity, after which the job weights are discounted …

We consider a problem of scheduling a set of independent jobs by two agents on a single
machine. Every agent has its own subset of jobs to be scheduled and uses its own optimality …

In this study, we introduce an actual time-dependent and job-dependent learning effect into
single-machine scheduling problems. We show that the complexity results of the makespan …

An uncertain uniform parallel machine scheduling problem with job deterioration and a
learning effect is considered. Job processing times, due dates, deterioration rates and …