Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval - Université de Lorraine Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2018

Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

Abstract

In this work we investigate the portfolio selection problem (P1) and bi-directional trading (P2) when prices are interrelated. Zhang et al. ( J. Comb. Optim. 23 (2012) 159–166) provided the algorithm UND which solves one variant of P2. We are interested in solutions which are optimal from a worst-case perspective. For P1, we prove the worst-case input sequence and derive the algorithm optimal portfolio for interrelated prices (OPIP). We then prove the competitive ratio and optimality. We use the idea of OPIP to solve P2 and derive the algorithm called optimal conversion for interrelated prices (OCIP). Using OCIP, we also design optimal online algorithms for bi-directional search (P3) called bi-directional UND (BUND) and optimal online search for unknown relative price bounds (RUN). We run numerical experiments and conclude that OPIP and OCIP perform well compared to other algorithms even if prices do not behave adverse.
No file

Dates and versions

hal-04000370 , version 1 (22-02-2023)

Identifiers

Cite

Imed Kacem, Hans Kellerer. Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. Lecture Notes in Computer Science, 2018, Lecture Notes in Computer Science, 11184 (2), pp.417-427. ⟨10.1007/978-3-030-00898-7_28⟩. ⟨hal-04000370⟩
19 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More