The lockmaster’s problem
详细信息 查看全文
- 作者：Ward Passchyna ; ward.passchyn@kuleuven.be" class="auth_mail" title="E-mail the corresponding author ; Sofie Coenea ; sofie.coene@kuleuven.be" class="auth_mail" title="E-mail the corresponding author ; Dirk Briskornc ; briskorn@uni-wuppertal.de" class="auth_mail" title="E-mail the corresponding author ; Johann L. Hurinkd ; j.l.hurink@utwente.nl" class="auth_mail" title="E-mail the corresponding author ; Frits C.R. Spieksma ; a ; frits.spieksma@kuleuven.be" class="auth_mail" title="E-mail the corresponding author ; Greet Vanden Bergheb ; greet.vandenberghe@cs.kuleuven.be" class="auth_mail" title="E-mail the corresponding author
- 关键词：Transportation ; Lock scheduling ; Batch scheduling ; Dynamic programming ; Complexity
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：1 June 2016
- 年：2016
- 卷：251
- 期：2
- 页码：432-441
- 全文大小：562 K
文摘
- class="listitem" id="list_celist0002">
- class="label">•
We introduce the problem of finding an optimal strategy for a lock
- class="label">•
We show how dynamic programming (DP) solves this lockmaster’s problem
- class="label">•
We further show how realistic extensions can be solved by extensions of this DP