Due date assignment and convex resource allocation scheduling with variable job processing times

Abstract

This is a study of a earliness and tardiness sequencing and scheduling problem on a single machine. The processing time for job J j depends on its position in a sequence, its starting time, and its allocation of non-renewable resource. For three due date assignment methods i.e. the common due date, the slack due date and the unrestricted due date our goal is to find the optimal schedule, due dates, and resource allocations of jobs. We prove that three versions of the problem can be solved in polynomial time, respectively.

The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect

“…In 2015, Li et al studied a single-machine scheduling problem with a slack due window, learning effect and resource allocation [19]. In 2016, Sun et al studied a single-machine scheduling problem with a due date and convex resource allocation [20]. In 2019, Geng et al studied a flow-shop scheduling problem with a common due date, resource allocation and learning effect [21].…”

A unified analysis for scheduling problems with variable processing times

“…For the cost function including makespan, total completion time (total waiting time), absolute difference of total completion time (total absolute differences in waiting times), and total resource cost, they proposed a polynomial time algorithm to solve this problem. Sun et al [23] considered resource allocation scheduling problems with deteriorating performance of jobs and learning under common due date assignment, slack due date assignment, and different due date assignment. They demonstrated that a cost function (including earliness, tardiness, due date allocation and total resource consumption) minimization could be solved in polynomial time.…”