.png){kind=icon}
Return
Mixed-time representation for state-task network models
.png){kind=icon}
PRE
AI
DOI：10.1021/ie0500117.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new mixed-time representation for STN-based scheduling models is proposed: the time grid is fixed, but processing times are allowed to be variable and span an unknown number of time periods. The proposed representation handles batch and continuous processes, and it accounts linearly for holding, backlog, and utility costs. It handles release and due dates at no additional computational cost, and it accounts for variable processing times. Computational improvements for the solution of the proposed mixed-integer programming formulation are also developed.
Keywords:
MULTIPURPOSE BATCH PLANTS
GENERAL ALGORITHM
FORMULATION
OPERATIONS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.9
Papers:
4.0W
Citations:
9.6W
Organization
No organization information available
Cited Papers
ShareSaveThe structure of Staphylococcus aureus epidermolytic toxin A, an atypic serine protease, at 1.7 Å resolution.png)
Structure
OAAI
StructureIF0
OAAIShareSaveShareSaveShareSaveShareSaveShareSave no more
no more