Search Results - "pseudo‐polynomial time algorithm"

Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization by Wang, Shuaian

“…•Pseudo-polynomial-time algorithm for optimal speeds in a network. In container liner shipping, bunker cost is an important component of the total operating cost…”
Get full text

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem by Shabtay, Dvir, Steiner, George, Yedidsion, Liron

“…In this paper the resource dependent assignment problem (RDAP) is considered. In the RDAP the cost of assigning agent j to task i is a multiplication of task…”
Get full text

Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system by Shabtay, Dvir

“…We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in…”
Get full text

Single-machine scheduling with machine unavailability periods and resource dependent processing times by Shabtay, Dvir

“…•We study a single-machine scheduling problem with a machine-unavailability period.•Processing times are resource-dependent.•The problem is known to be…”
Get full text

Faster Minimization of Tardy Processing Time on a Single Machine by Bringmann, Karl, Fischer, Nick, Hermelin, Danny, Shabtay, Dvir, Wellnitz, Philip

“… The problem is well-known to be NP-hard, but only in a weak sense, meaning it admits pseudo-polynomial time algorithms…”
Get full text

Scheduling problems with rejection in green manufacturing industry by Kong, Fanyu, Song, Jiaxin, Miao, Cuixia, Zhang, Yuzhong

“… is not more than a given threshold. We present pseudo-polynomial time algorithms and 2-approximation algorithms for the single-machine and the parallel-machine problems, respectively…”
Get full text

Two-agent parallel-machine scheduling with rejection by Li, Dawei, Lu, Xiwen

“…We study the two-agent scheduling with rejection on two parallel machines. There are two competing agents A and B with job families JA and JB, respectively. A…”
Get full text

Scheduling with step learning and job rejection: Scheduling with step learning and job rejection by Song, Jiaxin, Miao, Cuixia, Kong, Fanyu

“… For the former, we design a pseudo-polynomial time algorithm, a 2-approximation algorithm and a fully polynomial-time approximation scheme (FPTAS…”
Get full text

Efficient Folding Algorithms for Convex Polyhedra by Kamata, Tonan, Kadoguchi, Akira, Horiyama, Takashi, Uehara, Ryuhei

“…We investigate a folding problem that inquires whether a polygon P can be folded, without overlap or gaps, onto a polyhedron Q for given P and  Q . An…”
Get full text

Multitasking scheduling with alternate periods by Huo, Yujia, Miao, Cuixia, Kong, Fanyu, Zhang, Yuzhong

“… ) -approximation algorithm for the general case and a pseudo-polynomial time algorithm when the number of machines is constant…”
Get full text

The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects by Muştu, Settar, Eren, Tamer

“…This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and…”
Get full text

Proportionate flow-shop scheduling with rejection by Shabtay, Dvir, Oron, Daniel

“…In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for…”
Get full text

Two-agent scheduling with rejection on a single machine by Feng, Qi, Fan, Baoqiang, Li, Shisheng, Shang, Weiping

“…In this paper, we consider the two-agent scheduling problem with rejection on a single machine. In the problem we have two agents A and B with job families JA…”
Get full text

Two-stage medical supply chain scheduling with an assignable common due window and shelf life by Zhang, Long, Zhang, Yuzhong, Bai, Qingguo

“…This paper considers a two-stage medical supply chain scheduling problem from the perspective of the medicine manufacturer in which jobs have an assignable…”
Get full text

The just-in-time scheduling problem in a flow-shop scheduling system by Shabtay, Dvir

“…► We study several variants of the problem of maximizing the weighted number of JIT jobs in a flow-shop scheduling system. ► We show that the unweighted…”
Get full text

Approximation algorithm for the balanced 2-connected k-partition problem by Wu, Di, Zhang, Zhao, Wu, Weili

“…For two positive integers m,k and a connected graph G=(V,E) with a nonnegative vertex weight function w, the balanced m-connected k-partition problem, denoted…”
Get full text

Supply chain scheduling with receiving deadlines and non-linear penalty by Wang, Gang, Lei, Lei, Lee, Kangbok

“…We study the operations scheduling problem with delivery deadlines in a three-stage supply chain process consisting of (1) heterogeneous suppliers, (2)…”
Get full text

Two-machine flow-shop scheduling with rejection by Shabtay, Dvir, Gasper, Nufar

“…We study a scheduling problem with rejection on a set of two machines in a flow-shop scheduling system. We evaluate the quality of a solution by two criteria:…”
Get full text

A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system by Shabtay, Dvir, Bensoussan, Yaron, Kaspi, Moshe

“… We prove that although the problem is known to be NP - hard even for constant processing times, a pseudo-polynomial time algorithm for its solution exists…”
Get full text

A bicriteria approach to scheduling a single machine with job rejection and positional penalties by Shabtay, Dvir, Gaspar, Nufar, Yedidsion, Liron

“…Single machine scheduling problems have been extensively studied in the literature under the assumption that all jobs have to be processed. However, in many…”
Get full text