The TV advertisements scheduling problem
From MaRDI portal
Publication:1733325
DOI10.1007/s11590-018-1251-0zbMath1416.90004OpenAlexW2791113818WikidataQ130074983 ScholiaQ130074983MaRDI QIDQ1733325
Nir Halman, Fabián Díaz-Núñez, Oscar C. Vásquez
Publication date: 21 March 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1251-0
schedulingdynamic programmingfully polynomial time approximation scheme\(K\)-approximation sets and functionsTV rating points
Related Items (4)
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times ⋮ A branch and bound algorithm for optimal television commercial scheduling ⋮ Strongly polynomial FPTASes for monotone dynamic programs ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
Cites Work
- Unnamed Item
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
- The TV-break packing problem
- A mathematical programming study of advertising allocation problem.
- The single machine weighted mean squared deviation problem
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- For the airplane refueling problem local precedence implies global precedence
- The local-global conjecture for scheduling with non-linear cost
- Universal Sequencing on an Unreliable Machine
- Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- Scheduling Commercials on Broadcast Television
- On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
- The Geometry of Scheduling
- Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
- Scheduling Commercial Videotapes in Broadcast Television
- Dual Techniques for Scheduling on a Machine with Varying Speed
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
- Logistics and matter-element models based on firm innovative supply chains
This page was built for publication: The TV advertisements scheduling problem
