.png){kind=icon}
.png){kind=icon}
Return
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2014.08.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc. For this NP-hard problem that is related to the classical flow shop and open shop models, we present a simple 1.5-approximation algorithm and an improved 1.4-approximation algorithm. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Shop scheduling
Makespan minimization
Partially ordered route
Approximation
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.5
Papers:
1.0W
Citations:
3.8W