.png){kind=icon}
.png){kind=icon}
Return
Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.11.036.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present two new mixed integer programming formulations for the order acceptance and scheduling problem in two machine flow shops. Solving this optimization problem is challenging because two types of decisions must be made simultaneously: which orders to be accepted for processing and how to schedule them. To speed up the solution procedure, we present several techniques such as preprocessing and valid inequalities. An extensive computational study, using different instances, demonstrates the efficacy of the new formulations in comparison to some previous ones found in the relevant literature. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Order acceptance
Scheduling
Mixed integer programming
Preprocessing
Valid inequalities
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