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 …

In practice due dates usually behave more like intervals rather than specific points in time.
This paper studies hybrid flowshops where jobs, if completed inside a due window, are …

Vehicle routing and scheduling problems have a wide range of applications and have been
intensively studied in the past half century. The condition that enforces each vehicle to start …

This paper addresses the minimization of the absolute deviation of job completion times
from a common due date in a flowshop scheduling problem. Besides this main objective, the …

The scheduling of jobs over a single machine with sequence dependent setups is a
classical problem setting that appears in many practical applications in production planning …

This paper addresses the problem of scheduling n independent jobs on a single machine
with a fixed unavailability interval, where the aim is to minimize the total earliness and …

Traditionally, the three most important manufacturing functions are process planning,
scheduling, and due-date assignment, which are handled sequentially and separately. This …

This paper addresses the single machine scheduling problem with a common due date
aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the …

We introduce a fuzzy rule-based variable neighborhood search (FVNS) algorithm for a
single-machine weighted earliness/tardiness scheduling problem with common due date …

In the literature, earliness/tardiness (E/T) problem was known as weighted absolute
deviation problem, and both tardiness and earliness is very important performance criteria …