.png){kind=icon}
Return
A simple continuous-time process scheduling formulation and a novel solution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/0098-1354(96)00211-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a simple, yet general mathematical programming formulation for optimal scheduling of processes represented as Resource-Task Networks. The formulation is based on a continuous representation of time and leads to a mixed integer linear programming (MILP) problem. In common with other continuous-time scheduling formulations, this exhibits a large integrality gap that renders its solution using standard branch-and-bound algorithms highly problematic. A novel branch-and-bound algorithm that branches on both discrete and continuous variables is proposed to address this complication.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W
Organization
No organization information available
.png){kind=icon}
