This paper addresses single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times. Due-window assignment with common flow allowances means...

Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times

Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review

This article deals with an integrated optimization problem of production scheduling and common due-window assignment on a single machine. The objective is to minimize the total cost, which is a wei...

Due-window assignment scheduling problems with position-dependent weights on a single machine

This paper considers a two-machine flow shop scheduling problem with deteriorating jobs in which the processing times of jobs are dependent on their starting times in the sequence. The objective is to minimize the weighted sum of makespan and total completion time. To analyse the problem, we propose a mixed integer programming model, and discuss several polynomially solvable special cases. We also present a branch-and-bound algorithm with several dominance rules, an upper bound and a lower bound. Finally, we present results of computational experiments conducted to evaluate the performance of the proposed model and the exact algorithm.

https://papers.ssrn.com/sol3/Delivery.cfm/jors_2014_58.pdf?abstractid=2592964&mirid=1&type=2

Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time

This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O(n log n) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.

Single-machine common/slack due window assignment problems with linear decreasing processing times

In this paper, we consider a single-machine common due-window assignment scheduling problem with deteriorating jobs. Jobs’ processing times are defined by function of their starting times and job-dependent deterioration rates that are related to jobs and are not all equal. The objective is to determine an optimal combination of sequence and common due-window location so as to minimize the weighted sum of earliness, tardiness and due-window location penalties. We propose an O(n2 log n) time algorithm to solve the problem and discuss several instances to illustrate it.

J Liu

Papers

Single-machine scheduling with common due-window assignment for deteriorating jobs