Most classical scheduling research assumes that the objectives sought are common to all
jobs to be scheduled. However, many real-life applications can be modeled by considering …

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 …

Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …

Scheduling problems are combinatorial optimization problems in which some activities have
to be executed using resources that they need. A feasible allocation of the resources to the …

Scheduling problems can be understood in general as the problems of allocating resources
over time to perform a set of tasks being parts of some processes, among which …

We consider a scheduling problem involving a single processor being utilized by two or
more customers. Traditionally, such scenarios are modeled by assuming that each customer …

We consider a scheduling environment with m (m≥ 1) identical machines in parallel and
two agents. Agent A is responsible for n 1 jobs and has a given objective function with …

We consider the feasibility model of multi-agent scheduling on a single machine, where
each agent's objective function is to minimize the total weighted number of tardy jobs. We …

We consider the scheduling problems arising when several agents, each owning a set of
nonpreemptive jobs, compete to perform their respective jobs on one shared processing …

We consider the two-machine open shop and two-machine flow shop scheduling problems
in which each machine has to be maintained exactly once during the planning period, and …