.png){kind=icon}
.png){kind=icon}
Return
The consecutive multiprocessor job scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2019.12.043.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study a variant of the multiprocessor job scheduling problem, where jobs are processed by several identical machines. The machines are ordered in a sequence, and each job is processed by several consecutive machines simultaneously. The jobs are characterized by their processing time, the number of required consecutive machines, and their ready time. The objective function is to minimize the sum of general functions defined over the completion time of each job. This study is motivated by a real problem in the semiconductor industry. We present a time-indexed integer programming and a constraint programming formulations for the problem and demonstrate their applicability through an extensive numerical study and an industrial case study. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Scheduling
Multiprocessor job scheduling
Integer programming
Constraint programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W