English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The scheduling of films is a major problem for the movie theatre exhibitionbusiness. The problem is two-fold: movie exhibitors ideally would like toschedule films to screens in their various locations to maximize attendance andrevenue, but would also like to schedule these films such that neighbouringtheatre locations play the same films at different times thus giving guests amultitude of showtime options. We refer to this latter problem as the showtime\emph{staggering} problem. We give an exact formulation of this schedulingproblem using binary integer linear optimization, and provide a solved exampleas well. This work further shows that the optimal scheduling of films cannot bedone across all theatre locations at once, but rather, must be done for eachcluster of neighbouring locations.

On an Optimal Solution to the Film Scheduling and Showtime Staggering Problem