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 …

This article studies the single-machine scheduling problem with due date assignments,
deteriorating jobs, and past-sequence-dependent delivery times. Under three assignments …

This article considers the flow shop problem of minimising the total weighted completion
time in which the processing times of jobs are variable according to general position …

This paper considers single-machine position-dependent weights scheduling problem with
past-sequence-dependent delivery times and truncated sum-of-processing-times-based …

In this paper, we consider due-window assignment scheduling in the proportionate flow
shop setting with position-dependent weights where the weights depend on the position in …

In this paper, we address single-machine scheduling with sum of logarithm processing times-
based learning effect. Under exponential past-sequence-dependent delivery times, we …

This paper considers the single machine scheduling problem with due window, delivery time
and deteriorating job, whose goal is to minimize the window location, window size, earliness …

This article investigates the single-machine common due-window assignment problem with
generalized earliness/tardiness penalties and a rate-modifying activity. Job processing times …

Under just-in-time production, this paper studies a single machine common due-window
(denoted by CONW) assignment scheduling problem with position-dependent weights and …

Under common due window assignment, a single machine scheduling problem with
learning effect, delivery time and convex resource allocation is considered. Actual …