An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem

The problem of partitioning the elements of a graph G=(V, E) into two equal size sets A and B that share at most d elements such that the total number of edges (u, v), u∈A−B, v∈B−A is minimized, arises in the areas of Hypermedia Organization, Network Integrity, and VLSI Layout. We formulate the problem in terms of element duplication, where each element c∈A∩B is substituted by two copies c′∈A and c″∈B As a result, edges incident to c′ or c″ need not count in the cost of the partition. We show that this partitioning problem is NP-hard in general, and we present a solution which utilizes an optimal polynomial time algorithm for the special case where G is a series-parallel graph. We also discuss special other cases where the partitioning problem or variations are polynomially solvable.

Download Full-text

Polynomial Time Algorithm for Multi-Satellite Communications Scheduling Problem with Intersatellite Links

The Journal of Korean Institute of Information Technology ◽

10.14801/jkiit.2015.13.8.29 ◽

2015 ◽

Vol 13 (8) ◽

pp. 29

Author(s):

Sang-Un Lee

Keyword(s):

Polynomial Time ◽

Satellite Communications ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Scheduling Problem

Download Full-text

Optimal Polynomial Time Algorithm for Restoring Multicast Cloud Services

IEEE Communications Letters ◽

10.1109/lcomm.2016.2571691 ◽

2016 ◽

Vol 20 (8) ◽

pp. 1543-1546 ◽

Cited By ~ 3

Author(s):

Sara Ayoubi ◽

Chadi Assi ◽

Lata Narayanan ◽

Khaled Shaban

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Cloud Services ◽

Optimal Polynomial

Download Full-text

A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine

Discrete Dynamics in Nature and Society ◽

10.1155/2015/503297 ◽

2015 ◽

Vol 2015 ◽

pp. 1-4 ◽

Cited By ~ 1

Author(s):

Peng Liu ◽

Lini Duan

Keyword(s):

Cost Function ◽

Single Machine ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Release Time ◽

Scheduling Problem ◽

Two Agents ◽

Release Times ◽

Agent Scheduling ◽

Optimal Polynomial

We consider a scheduling problem in which both resource dependent release times and two agents exist simultaneously. Two agents share a common single machine, and each agent wants to minimize a cost function dependent on its own jobs. The release time of eachA-agent’s job is related to the amount of resource consumed. The objective is to find a schedule for the problem of minimizingA-agent’s total amount of resource consumption with a constraint onB-agent’s makespan. The optimal properties and the optimal polynomial time algorithm are proposed to solve the scheduling problem.

Download Full-text