The two-machine flowshop scheduling problem with total tardiness (Q1115798): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(89)90005-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161087400 / rank | |||
Normal rank | |||
Revision as of 00:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-machine flowshop scheduling problem with total tardiness |
scientific article |
Statements
The two-machine flowshop scheduling problem with total tardiness (English)
0 references
1989
0 references
This paper considers the criterion of minimizing total job tardiness in the two-machine flowshop system. The conditions that determine which of a pair of adjacent jobs in a sequence should precede the other to minimize total job tardiness are derived. A branch-and-bound solution procedure to reach an optimal solution to the problem is developed. A simple and computationally efficient heuristic is also presented. Moreover, an illustrative example together with the computational characteristics of the algorithm and the heuristic is provided.
0 references
total job tardiness
0 references
two-machine flowshop
0 references
branch-and-bound
0 references
heuristic
0 references
