Výsledky vyhledávání - "pseudo-polynomial dynamic programming algorithms"

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ískat plný text

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ískat 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ískat plný text

Due-Date assignment with acceptable lead-times on parallel machines Autor Mor, Baruch, Mosheiov, Gur

“…•Then, job-dependent lead-times and identical earliness and tardiness costs are assumed.•Pseudo-polynomial dynamic programming algorithms are introduced for all problems…”
Získat plný text

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

“…•This is the first paper to consider two-agent scheduling under rejection cost constraints.•We consider pooled rejection budgets as well as agent dedicated…”
Získat plný text

A Greedy heuristic for solving scheduling problems with bounded rejection cost Autor Atsmony, Matan, Mosheiov, Gur

“…•We introduce pseudo-polynomial dynamic programming algorithms for all problems.•A heuristic of a greedy type is introduced and tested…”
Získat 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ískat plný text

Two-agent single-machine scheduling with a rate-modifying activity Autor Phosavanh, Johnson, Oron, Daniel

“…We study single-machine scheduling problems involving a rate-modifying activity and two competing agents with due-date-related functions. Classical scheduling…”
Získat plný text

Scheduling on parallel dedicated machines with job rejection Autor Mor, Baruch, Mosheiov, Gur

“…, and ( $ vi $ vi ) minimising maximum tardiness. Pseudo-polynomial dynamic programming algorithms are introduced for all these NP-hard problems…”
Získat plný text

Single-machine and flow-shop scheduling with supporting tasks in a nested structure Autor Yu, Renjie, Oron, Daniel, Lin, Bertrand M. T.

“… By leveraging the optimality properties unique to this structure, we develop efficient polynomial and pseudo-polynomial dynamic programming algorithms to solve single-agent problems in a single…”
Získat plný text

A note: flowshop scheduling with linear deterioration and job-rejection Autor Mor, Baruch, Mosheiov, Gur

“…), and we introduce pseudo-polynomial dynamic programming algorithms, thus proving that both problems are NP-hard in the ordinary sense…”
Získat plný text

Minsum scheduling with acceptable lead-times and optional job rejection Autor Mor, Baruch, Shapira, Dana

“…In our current fast-paced era, customers are often willing to pay extra premium for shorter lead times, which motivates further research on the scheduling…”
Získat plný text

Two-agent scheduling with agent specific batches on an unbounded serial batching machine Autor Kovalyov, Mikhail Y., Oulamara, Ammar, Soukhal, Ameur

“…We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this…”
Získat plný text

Scheduling on a proportionate flowshop to minimise total late work Autor Gerstl, Enrique, Mor, Baruch, Mosheiov, Gur

“… We prove a crucial property of an optimal schedule, and consequently introduce efficient pseudo-polynomial dynamic programming algorithms for the two versions…”
Získat plný text

Single machine lot scheduling with optional job-rejection Autor Mor, Baruch, Mosheiov, Gur, Shapira, Dana

“… All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases…”
Získat plný text

A two-agent single-machine scheduling problem with late work criteria Autor Wang, Du-Juan, Kang, Chao-Chung, Shiau, Yau-Ren, Wu, Chin-Chia, Hsu, Peng-Hsiang

“… exceed a given value. Two pseudo-polynomial dynamic programming algorithms are presented to find the optimal solutions for small-scale problem instances…”
Získat plný text

Single-machine scheduling with a common due window Autor Yeung, W.K., Oguz, Ceyda, Cheng, T.C.Edwin

“…–tardiness weights are agreeable for the first problem. We propose pseudo-polynomial dynamic programming algorithms to optimally solve the problems…”
Získat plný text

Optimization Problems and Algorithms in Double-layered Food Packing Systems Autor Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG

“…In this paper, we discuss lexicographic bi-criteria combinatorial optimization problems arising in two types of double-layered food packing systems, which we…”
Získat plný text

Single machine scheduling with discretely controllable processing times Autor Chen, Zhi-Long, Lu, Qing, Tang, Guochun

“…In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be…”
Získat 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ískat plný text