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

2019 ◽  
Vol 52 (2) ◽  
pp. 185-193 ◽  
Author(s):  
Ji-Bo Wang ◽  
Bo Zhang ◽  
Lin Li ◽  
Danyu Bai ◽  
Yu-Bo Feng
Keyword(s):  
Single Machine ◽  
Scheduling Problems ◽  
Due Window ◽  
Due Window Assignment

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.

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.

COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES

2014 ◽  
Vol 31 (01) ◽  
pp. 1450004 ◽  
Author(s):  
XINGONG ZHANG
Keyword(s):  
Operations Management ◽  
Production Scheduling ◽  
Window Size ◽  
Deteriorating Jobs ◽  
Planning Horizon ◽  
Scheduling Problems ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Maintenance Activities ◽  
Due Window Assignment

Due-window assignment and production scheduling problems are important issues in operations management. In this paper, the problems of common due-window assignment and scheduling of job-dependent deteriorating jobs and multiple deteriorating maintenance activities simultaneously on a single-machine are investigated. We assume that the machine may be subjected to several maintenance activities during the planning horizon. However, due to the restriction of budget of maintenance, the upper bound of the maintenance frequency on the machine is assumed to be known in advance. Moreover, we assume that the duration of each maintenance activity depends on the running time of the machine. Polynomial time algorithms for the all the studied problems are provided, where the objective is to simultaneously minimize the earliness, tardiness, due-window starting time, and due-window size costs.

scholarly journals Optimization for Due-Window Assignment Scheduling with Position-Dependent Weights

2020 ◽  
Vol 2020 ◽  
pp. 1-7 ◽  
Author(s):  
Li-Yan Wang ◽  
Dan-Yang Lv ◽  
Bo Zhang ◽  
Wei-Wei Liu ◽  
Ji-Bo Wang
Keyword(s):  
Single Machine ◽  
General Position ◽  
Processing Time ◽  
Window Size ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scheduling Problem ◽  
Starting Time ◽  
Due Window ◽  
Due Window Assignment

This paper considers a single-machine due-window assignment scheduling problem with position-dependent weights, where the weights only depend on their position in a sequence. The objective is to minimise the total weighted penalty of earliness, tardiness, due-window starting time, and due-window size of all jobs. Optimal properties of the problem are given, and then, a polynomial-time algorithm is provided to solve the problem. An extension to the problem is offered by assuming general position-dependent processing time.

Sign in / Sign up

Export Citation Format

Share Document