In this chapter we consider the scheduling problems with minimization of the earliness and
tardiness costs, where all tasks should be completed at the same due date. Problems with …

This paper considers two-agent just-in-time scheduling where agents A and B have to share
m unrelated parallel machines for processing their jobs. The objective of agent A is to …

We provide an overview of the history, the methods and the people who researched on
minimizing the (weighted) number of tardy jobs as a performance measure. The review …

We study the problem of maximizing the weighted number of just-in-time (JIT) jobs in a flow-
shop scheduling system under four different scenarios. The first scenario is where the flow …

We provide new parameterized complexity results for Interval Scheduling on Eligible
Machines. In this problem, a set of n jobs is given to be processed non-preemptively on a set …

In this paper we consider the maximization of the weighted number of just-in-time jobs that
should be completed exactly on their due dates in n-job, m-machine flow shop problems. We …

We consider the scheduling problem in which two agents (agents A and B), each having its
own job set (containing the A-jobs and B-jobs, respectively), compete to process their own …

We study a multi-scenario scheduling problem on a single-machine and a two-machine flow-
shop system. The criterion is to maximise the weighted number of just-in-time jobs. We first …

This book provides an introduction to the models, methods, and results of some due date-
related scheduling problems in the context of multi-agent scheduling. In multi-agent …

The problem of maximizing the weighted number of just-in-time jobs in a two-machine flow
shop scheduling system is known to be NP-hard (Choi and Yoon in J. Shed. 10: 237–243 …