A branch and bound algorithm for optimal television commercial scheduling

DOI10.3934/mbe.2022231zbMath1501.90029OpenAlexW4224292537MaRDI QIDQ2086864

Lu-Wen Liao

Publication date: 26 October 2022

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

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

zbMATH Keywords

schedulingbranch and bound algorithmservice level requirement\(LFJ/EDD\) ruleTV commercials

Mathematics Subject Classification ID

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

Cites Work

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

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