A branch and bound algorithm for optimal television commercial scheduling

DOI10.3934/MBE.2022231MaRDI QIDQ2086864zbMATH OpenOpenAlexFDO

Authors Lu-Wen Liao

Publication date 26 October 2022

Published in Mathematical Biosciences and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/mbe.2022231

zbMATH Keywords

\(LFJ/EDD\) rulebranch and bound algorithmschedulingservice level requirementTV commercials

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Marketing, advertising (90B60) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• Conflict resolution in the scheduling of television commercials
• Scheduling advertising slots for television
• Scheduling Commercial Videotapes in Broadcast Television
• Scheduling Commercials on Broadcast Television
• Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
• Scheduling with limited machine availability
• The complexity of scheduling TV commercials
• The TV advertisements scheduling problem

Cited in

(6)

• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
• New formulations for the conflict resolution problem in the scheduling of television commercials
• The complexity of scheduling TV commercials
• Non‐dominated “trade‐off” solutions in television scheduling optimization
• Sales plan generation problem on TV broadcasting
• A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising

This page was built for publication: A branch and bound algorithm for optimal television commercial scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086864)