Multiple Common Due-Window Assignment Based on Common Flow Allowance and Resource-Dependent Processing Times

2014 ◽  
Vol 644-650 ◽  
pp. 2026-2029
Author(s):  
Cheng Xin Luo ◽  
En Min Feng
Keyword(s):  
Optimal Algorithm ◽  
Window Size ◽  
Optimal Size ◽  
Processing Times ◽  
Due Windows ◽  
Resource Cost ◽  
Due Window ◽  
Resource Allocation Scheme ◽  
Due Window Assignment ◽  
Flow Allowance

This paper studies a multiple common due-window assignment problem on a single machine. The job-dependent due-windows are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal size and location of the multiple common due-windows, the set of jobs assigned to each due window, the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location, earliness and tardiness of jobs and resource cost. We propose an optimal algorithm to solve the problem.

Optimal Due-Window Assignment Based on Common Flow Allowance under Linear Deteriorating and Resource-Dependent Processing Times

2013 ◽  
Vol 344 ◽  
pp. 275-278
Author(s):  
Cheng Xin Luo
Keyword(s):  
Window Size ◽  
Optimal Size ◽  
Processing Times ◽  
Due Windows ◽  
Resource Cost ◽  
Due Window ◽  
The Common ◽  
Resource Allocation Scheme ◽  
Due Window Assignment ◽  
Flow Allowance

This paper studies a due-window assignment problem on a single machine. The job-dependent due-windows are obtained by the common flow allowance criterion. We assume that the processing time of a job is a linear function of its starting time and decreasing function of the resource amount assigned to it. The objective is to find the optimal size and location of the due-windows, the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location, the earliness and tardiness of jobs and resource cost. We propose an algorithm to solve the problem.

Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects

2015 ◽  
Vol 32 (03) ◽  
pp. 1550014 ◽  
Author(s):  
Chuanli Zhao ◽  
Hengyong Tang
Keyword(s):  
Single Machine ◽  
Polynomial Solution ◽  
Window Size ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Due Windows ◽  
Due Window ◽  
Positional Effects ◽  
Due Window Assignment ◽  
Flow Allowance

This paper considers a single machine scheduling with both deterioration and positional effects and due-window assignment problem. The job-dependent due-windows are obtained by the common flow allowance criterion. The objective is to schedule the jobs, and the due-windows so as to minimize the sum of earliness, tardiness, and due-window starting time and due-window size costs. We introduce a polynomial solution for the problem. Furthermore, we show how the solutions can be extended to the setting with job rejection.

Single Machine Multiple Common due Dates Assignment Based on Common Flow Allowance and Resource-Dependent Processing Times

2014 ◽  
Vol 644-650 ◽  
pp. 2022-2025
Author(s):  
Cheng Xin Luo ◽  
En Min Feng
Keyword(s):  
Single Machine ◽  
Optimal Algorithm ◽  
Due Dates ◽  
Due Date ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Resource Cost ◽  
The Common ◽  
Resource Allocation Scheme ◽  
Flow Allowance

This paper studies a multiple common due date assignment problem on a single machine. The job-dependent due dates are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal multiple common dues, the set of jobs assigned to each due date, the sequence of jobs and resource allocation scheme to minimize a total cost based on earliness and tardiness of jobs, the common dues and resource cost. We propose an optimal algorithm to solve the problem.

scholarly journals Due-Window Assignment Scheduling with Variable Job Processing Times

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Yu-Bin Wu ◽  
Ping Ji
Keyword(s):  
Processing Time ◽  
Learning Effect ◽  
Window Size ◽  
Starting Time ◽  
Processing Times ◽  
Due Windows ◽  
Weighted Number ◽  
Due Window ◽  
Tardy Jobs ◽  
Due Window Assignment

We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.

Optimal Common Due-Window Assignment with Linear Deteriorating and Resource-Dependent Processing Times under a Deteriorating Maintenance Activitiy

2013 ◽  
Vol 344 ◽  
pp. 290-293
Author(s):  
Cheng Xin Luo
Keyword(s):  
Window Size ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Maintenance Activity ◽  
Machine Maintenance ◽  
Processing Times ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Resource Allocation Scheme ◽  
Due Window Assignment

This paper studies single-machine scheduling problems with a due-window assignment under a deteriorating maintenance and time-and-resource-dependent processing times. Jobs completed within the due-window incur no penalties, other jobs incur either earliness or tardiness penalties. The maintenance activity can be scheduled immediately after any of the completed jobs. We assume that once the maintenance activity has been completed, the machine efficiency will be improved and the machine maintenance duration depends on its starting time. The objective is to find the maintenance position, the size and location of the due-window, and the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location and the earliness and tardiness of jobs and resource. We propose an algorithm to solve the problem.

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.

Common Due-Window Assignment and Group Scheduling with Position-Dependent Processing Times

2015 ◽  
Vol 32 (06) ◽  
pp. 1550045 ◽  
Author(s):  
Shang-Chia Liu
Keyword(s):  
Single Machine ◽  
Group Technology ◽  
Window Size ◽  
Setup Time ◽  
Single Machine Scheduling ◽  
Processing Times ◽  
Weighted Number ◽  
Due Window ◽  
Tardy Jobs ◽  
Due Window Assignment

This paper investigates a single-machine scheduling problem involving both the due-window assignment and position-dependent processing times under a group technology environment. By position-dependent processing times, we mean that the processing time of a job is dependent of its processing position in the job sequence within the group it belongs to. A setup time is incurred whenever the single machine transfers job processing from a group to another group. Each group is assigned an assignable common due-window. A job completed earlier (respectively, later) than the common due-window of the group it belongs to will incur an earliness (respectively, tardiness) penalty. The objective is to determine the optimal group sequence, the optimal job sequence, and the optimal due-window assignment so as to minimize the total cost including the earliness and tardiness (or weighted number of tardy jobs) penalties, black and the due-window starting time and due-window size costs. We show that both the problems can be solved in polynomial times.

Single-Machine Scheduling with Due-Window Assignment and Rate-Modifying-Activities under a Deteriorating Maintenance

2013 ◽  
Vol 278-280 ◽  
pp. 2248-2251
Author(s):  
Cheng Xin Luo
Keyword(s):  
Single Machine ◽  
Window Size ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Optimal Size ◽  
Scheduling Problems ◽  
Maintenance Activity ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Due Window Assignment

This paper studies single-machine scheduling problems with a due-window assignment and a rate-modifying activity under a deteriorating maintenance consideration simultaneously. Jobs completed within the due-window incur no penalties, other jobs incur either earliness or tardiness penalties. The maintenance activity can be scheduled immediately after any one of the completed jobs. We assume that once the maintenance activity has been completed, the machine efficiency will be improved and the machine maintenance duration depends on its starting time. The objective is to find the optimal maintenance position as well as the optimal size and location of the due-window, and the sequence of jobs to minimize a cost function based on the window size and window location and the earliness and tardiness of the jobs. We propose a polynomial time algorithm to solve the problem optimally.

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.

Sign in / Sign up

Export Citation Format

Share Document