A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

2017 ◽  
Vol 64 (1) ◽  
pp. 41-63 ◽  
Author(s):  
Dujuan Wang ◽  
Yunqiang Yin ◽  
T.C.E. Cheng
Keyword(s):  
Controllable Processing Times ◽  
Processing Times ◽  
Due Window ◽  
Due Window Assignment

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.

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.

Sign in / Sign up

Export Citation Format

Share Document