In this paper, a survey of scheduling problems with due windows is presented. The due
window of a job is a generalization of the classical due date and it is a time interval in which …

This paper deals with earliness and tardiness scheduling around common due dates and
windows. Related problems share a strong practical importance due to the endogenous and …

We aim at providing a unified framework of the common due date assignment and
scheduling problems in the deterministic case by surveying the literature concerning the …

In this paper, an overview of the research devoted to these problems with emphasis on the
case of the optimal makespan on identical parallel machines is presented. Scheduling …

This paper presents a scheduling problem for unrelated parallel machines with sequence-
dependent setup times, using simulated annealing (SA). The problem accounts for allotting …

Early investigations of the learning phenomenon focused on the behavior of individual
subjects who were learning-by-doing. These investigations revealed that the time required …

This paper addresses the problem of scheduling a set of independent jobs on unrelated
parallel machines with job sequence dependent setup times so as to minimize a weighted …

This article addresses a multi-stage flow shop scheduling problem with unrelated parallel
machines. Some practical processing restrictions such as independent setup and …

This paper presents several search heuristics and their performance in batch scheduling of
parallel, unrelated machines. Identical or similar jobs are typically processed in batches in …

This paper investigates an unrelated parallel machine scheduling problem with a restrictive
common due date. The objective is to minimize the total sum of earliness/tardiness costs …