Výsledky vyhľadávania - pseudo-polynomial dynamic programming algorithms*

CON/SLK due date assignment and scheduling on a single machine with two agents Autor Yin, Yunqiang, Wang, Du-Juan, Wu, Chin-Chia, Cheng, T.C.E.

“…We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their…”
Získať plný text

Two-agent single-machine scheduling to minimize the batch delivery cost Autor Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Wang, Du-Juan, Wu, Chin-Chia

“…•Integrated production and batch delivery scheduling with two agents is considered.•Constrained optimization problems on various criteria of the two agents are…”
Získať plný text

An optimization model for freight transport using urban rail transit Autor Ozturk, Onur, Patrick, Jonathan

“…•Approximation and dynamic programming algorithms for two station cases.•Multiple station problem modeled as an interval graph…”
Získať plný text

Single machine scheduling with assignable due dates to minimize maximum and total late work Autor Justkowiak, Jan-Erik, Kovalev, Sergey, Kovalyov, Mikhail Y., Pesch, Erwin

“…•Two pseudo-polynomial dynamic programming algorithms and an FPTAS are described for the latter…”
Získať plný text

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work Autor Yin, Yunqiang, Xu, Jianyou, Cheng, T. C. E., Wu, Chin-Chia, Wang, Du-Juan

“… We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial…”
Získať plný text

The dry dock scheduling problem Autor Jia, Shuai, Li, Chung-Lun, Meng, Qiang

“…Dry docks are essential facilities for ship maintenance and thus are critical assets of a shipyard. In this paper, we study a dry dock scheduling problem that…”
Získať plný text

NPRACH-Aware Link Adaptation and Uplink Resource Allocation in NB-IoT Cellular Networks Autor Yu, Ya-Ju, Wang, Jhih-Kai

“…In narrowband Internet of Things (NB-IoT), a link adaptation technique can be performed, considering multiple resource unit types, repetition numbers, and…”
Získať plný text

Scheduling linear deteriorating jobs with rejection on a single machine Autor Cheng, Yushao, Sun, Shijie

“… We show that these problems are NP-hard, and design algorithms based on dynamic programming…”
Získať plný text

Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection Autor Gerstl, Enrique, Mor, Baruch, Mosheiov, Gur

“…•We study extensions of a minmax due-date assignment problem with a bound on due-dates.•The first extension is to position-dependent processing times.•A…”
Získať plný text

Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach Autor Engler, Martin S., Caron, Bertrand, Veen, Lourens, Geerke, Daan P., Mark, Alan E., Klau, Gunnar W.

“…A key factor in computational drug design is the consistency and reliability with which intermolecular interactions between a wide variety of molecules can be…”
Získať plný text

Complexity and algorithms for copy-number evolution problems Autor El-Kebir, Mohammed, Raphael, Benjamin J., Shamir, Ron, Sharan, Roded, Zaccaria, Simone, Zehavi, Meirav, Zeira, Ron

“…Background Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent…”
Získať plný text

A single-item lot-sizing problem with a by-product and inventory capacities Autor Suzanne, Elodie, Absi, Nabil, Borodin, Valeria, van den Heuvel, Wilco

“…•A pseudo-polynomial dynamic programming (DP) algorithm is proposed for ULS-B.•For ULS-B with constant inventory capacities, a polynomial DP algorithm is developed…”
Získať plný text

Two-agent scheduling problems under rejection budget constraints Autor Oron, Daniel

“…•We consider pooled rejection budgets as well as agent dedicated budgets.•We provide efficient pseudo-polynomial time dynamic programming algorithms for the NP-hard problems under consideration…”
Získať plný text

Nonconvex piecewise linear knapsack problems Autor Kameshwaran, S., Narahari, Y.

“… Two separate mixed integer linear programming…”
Získať plný text

Scheduling deteriorating jobs under disruption Autor Zhao, Chuan-Li, Tang, Heng-Yong

“…This paper considers machine scheduling problems with deteriorating jobs under disruption. There are two types of disruption. In the first one we cannot know…”
Získať plný text

A novel two-stage approach for energy-efficient timetabling for an urban rail transit network Autor Huang, Kang, Liao, Feixiong

“…•A novel model reformulation as a tree knapsack problem is developed to determine train running times by a pseudo-polynomial dynamic programming algorithm…”
Získať plný text

The coordination of transportation and batching scheduling Autor Tang, Lixin, Gong, Hua

“…We study a coordinated scheduling problem of production and transportation in which each job is transported to a single batching machine for further…”
Získať plný text

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times Autor Wang, Dujuan, Yin, Yunqiang, Cheng, T.C.E.

“…We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the…”
Získať plný text

Using submodularity within column generation to solve the flight-to-gate assignment problem Autor Li, Yijiang, Clarke, John-Paul, Dey, Santanu S.

“…•Trackable column generation method for large-sized flight-to-gate assignment problems.•Use of submodularity in column generation in solving pricing…”
Získať plný text

Single-machine common due date total earliness/tardiness scheduling with machine unavailability Autor Bülbül, Kerem, Kedad-Sidhoum, Safia, Şen, Halil

“…Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints…”
Získať plný text