At Endcrawl we're always thinking about the hard work that goes into making film and TV, and how that work translates to on-screen credits. A feature film may involve thousands of people, hundreds of distinct job titles or "roles," and dozens of departments. So there's plenty for a producer to worry about, like: Did we forget or misspell a name? Is this the correct way to credit that role? Do all
整数計画ソルバーでシフトスケジューリング問題を解いてみた
はじめに 無償の整数計画ソルバーでどれぐらいの規模のシフトスケジューリング問題が解けるか確かめたくなったので試してみました。 今回は、久保先生の『Pythonによる実務で役立つ最適化問題100+(3)―配送計画・パッキング・スケジューリング―』のシフトスケジューリング問題を取り上げます。出典は下記の論文で、テストデータはOR-Libraryからダウンロードできます。 M.Krishnamoorthy, A.T.Ernst, D.Baatar, Algorithms for large scale shift minimisation personnel task shcduling problems, European Journal of Operational Research, 219 (2012), 34-48. 論文を読み始めたら期待している問題設定と違ったし、久保先生がサンプル
"The closer to the train station, the worse the kebab" - A "Study" - James Pae
This write-up was originally posted on reddit, though I've cleaned things up specifically for this post. Due to reasons discussed towards the end of this post, I'm not entirely happy with the results and intend to take another shot at it in the near future. Introduction🔗 I came across this post sharing a hypothesis from a French subreddit; The closer to the train station, the worse the kebab. The
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Ordering Movie Credits With Graph Theory