.png){kind=icon}
.png){kind=icon}
Return
A mixed integer programming approach for the single machine problem with unequal release dates
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.06.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This algorithm includes the implementation of a preprocessing procedure together with the consideration of valid inequalities. A computer simulation to measure the performance of the algorithm shows that our proposed method outperforms state-of-the-art branch-and-bound algorithms. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Mixed integer programming
Preprocessing
Valid inequalities
Release dates
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:
4.3
Papers:
6.5K
Citations:
1.8W