scholarly journals Minimum Length Scheduling for Multi-Cell Full Duplex Wireless Powered Communication Networks

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6599
Author(s):  
Muhammad Shahid Iqbal ◽  
Yalcin Sadi ◽  
Sinem Coleri
Keyword(s):  
Power Control ◽  
Communication Networks ◽  
Signal To Noise Ratio ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Global Optimum ◽  
Full Duplex ◽  
Transmission Model ◽  
Minimum Length ◽  
Scheduling Problem

Wireless powered communication networks (WPCNs) will be a major enabler of massive machine type communications (MTCs), which is a major service domain for 5G and beyond systems. These MTC networks will be deployed by using low-power transceivers and a very limited set of transmission configurations. We investigate a novel minimum length scheduling problem for multi-cell full-duplex wireless powered communication networks to determine the optimal power control and scheduling for constant rate transmission model. The formulated optimization problem is combinatorial in nature and, thus, difficult to solve for the global optimum. As a solution strategy, first, we decompose the problem into the power control problem (PCP) and scheduling problem. For the PCP, we propose the optimal polynomial time algorithm based on the evaluation of Perron–Frobenius conditions. For the scheduling problem, we propose a heuristic algorithm that aims to maximize the number of concurrently transmitting users by maximizing the allowable interference on each user without violating the signal-to-noise-ratio (SNR) requirements. Through extensive simulations, we demonstrate a 50% reduction in the schedule length by using the proposed algorithm in comparison to unscheduled concurrent transmissions.

Slack Due-Window Assignment Scheduling Problem with Deterioration Effects and a Deteriorating Maintenance Activity

2022 ◽  
Author(s):  
Xue Jia ◽  
Dan-Yang Lv ◽  
Yang Hu ◽  
Ji-Bo Wang ◽  
Zhi Wang ◽  
...  
Keyword(s):  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Machining Process ◽  
Scheduling Problem ◽  
Maintenance Activity ◽  
Starting Time ◽  
Weighted Number ◽  
Deteriorating Maintenance ◽  
Due Window ◽  
Due Window Assignment

This paper studies the slack due-window assignment scheduling problem with deterioration effects and a deterioration maintenance activity on a single-machine. The machine deteriorates during the machining process, and at a certain moment performs a deterioration maintenance activity, that is, the duration time of the maintenance activity is a linear function of the maintenance starting time. It is needed to make a decision on when to schedule the deteriorating maintenance activity, the optimal common flow allowances and the sequence of jobs to minimize the weighted penalties for the sum of earliness and tardiness, weighted number of early and delayed, and weighted due-window starting time and size. This paper proposes a polynomial time algorithm to solve this problem.

A STOCHASTIC BATCHING AND SCHEDULING PROBLEM

2001 ◽  
Vol 15 (4) ◽  
pp. 465-479 ◽  
Author(s):  
Ger Koole ◽  
Rhonda Righter
Keyword(s):  
Optimal Policy ◽  
Semiconductor Manufacturing ◽  
Processing Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Flow Time ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Deterministic Problem

We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flow time. The problem is much more difficult than the corresponding deterministic problem, and the optimal policy may have many counterintuitive properties. We prove various structural properties of the optimal policy and use these to develop a polynomial-time algorithm to compute the optimal policy.

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.

A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM

2007 ◽  
Vol 24 (01) ◽  
pp. 45-56 ◽  
Author(s):  
LONGMIN HE ◽  
SHIJIE SUN ◽  
RUNZI LUO
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Two Stage ◽  
Batch Processor ◽  
Flowshop Scheduling Problem ◽  
Stage 1

This paper considers a batch scheduling problem in a two-stage hybrid flowshop that consists of m dedicated parallel machines in stage 1 and a batch processor in stage 2. The processing time of a batch is defined as the largest processing time of the jobs contained in that batch. The criterion is to minimize the makespan, the time by which all operations of jobs have been processed. For such a problem, we present a polynomial time algorithm for the case with all jobs having the same processing time on the batch processor. An approximation algorithm with a competitive ratio 2 for the general case is also presented.

Sign in / Sign up

Export Citation Format

Share Document