Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
详细信息 查看全文
- 作者：Ridvan Gedik ; a ; rgedik@newhaven.edu" class="auth_mail" title="E-mail the corresponding author ; Chase Rainwaterb ; cer@uark.edu" class="auth_mail" title="E-mail the corresponding author ; Heather Nachtmannb ; hln@uark.edu" class="auth_mail" title="E-mail the corresponding author ; Ed A. Pohlb ; epohl@uark.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Constraint programming ; Mixed integer programming ; Logic-based Benders decomposition ; Scheduling with job availability intervals ; Sequence dependent setup times
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：1 June 2016
- 年：2016
- 卷：251
- 期：2
- 页码：640-650
- 全文大小：966 K
文摘
- •
We examine a parallel machine scheduling problem with setup times and time windows.
- •
Integer programming (IP) and constraint programming (CP) models are proposed.
- •
Two logic-based Benders decomposition algorithms are developed.
- •
Extensive computational tests on a real-life case study are performed.
- •
We report the effectiveness of the algorithms over pure IP and CP models.