.png){kind=icon}
Return
AN EFFICIENT ALGORITHM FOR A JOB-SHOP PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02099698.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [1,2], Hefetz and Adiri [7], and Timkovskiy [15]. The idea behind the algorithm has the potential of extension to job shops with parallel machines.
Keywords:
COMPLEXITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more