Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

2013 ◽  
Vol 66 (4) ◽  
pp. 952-961 ◽  
Author(s):  
Min Ji ◽  
Jiaojiao Ge ◽  
Ke Chen ◽  
T.C.E. Cheng
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Aging Effect ◽  
Due Window ◽  
Due Window Assignment

Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties

2021 ◽  
pp. 2150041
Author(s):  
Yu Tian
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Window Size ◽  
Single Machine Scheduling ◽  
Start Time ◽  
Optimal Sequence ◽  
Optimal Resource ◽  
Due Window ◽  
Weighted Earliness ◽  
Due Window Assignment

In this study, the due-window assignment single-machine scheduling problem with resource allocation is considered, where the processing time of a job is controllable as a linear or convex function of amount of resource allocated to the job. Under common due-window and slack due-window assignments, our goal is to determine the optimal sequence of all jobs, the due-window start time, due-window size, and optimal resource allocation such that a sum of the scheduling cost (including weighted earliness/tardiness penalty, weighted number of early and tardy job, weighted due-window start time, and due-window size) and resource consumption cost is minimized. We analyze the optimality properties, and provide polynomial time solutions to solve the problem under four versions of due-window assignment and resource allocation function.

Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times

2014 ◽  
Vol 31 (05) ◽  
pp. 1450036 ◽  
Author(s):  
Ji-Bo Wang ◽  
Ming-Zheng Wang
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Processing Time ◽  
Window Size ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Due Window ◽  
Due Window Assignment

We consider a single-machine common due-window assignment scheduling problem, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The window location and size, along with the associated job schedule that minimizes a certain cost function, are to be determined. This function is made up of costs associated with the window location, window size, earliness, and tardiness. For two different processing time functions, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation, respectively.

Sign in / Sign up

Export Citation Format

Share Document