.png){kind=icon}
Return
Demonstrating Johnson's algorithm via resource-constrained scheduling
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2017.1314040.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The celebrated Johnson's algorithm to solve the two-machine flowshop scheduling problem to minimise the makespan plays a prominent role in scheduling research. In using resource-constrained scheduling to interpret Johnson's algorithm in teaching scheduling theory and operations management, we have received positive student feedback on the perceived intuition. We demonstrate this idea and show that the resource-constrained scheduling concept also helps simplify the proofs of some classical scheduling results.
Keywords:
scheduling
flowshop
makespan
relocation problem
resource constraint
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
Cited Papers
Researcher Choices for Infant Sleep Assessment: Parent Report, Actigraphy, and a Novel Video System
PREAI
ShareSave
ShareSaveHigh-order derivative spectrophotometric determination of uranium in a cationic micellar medium.png)
The Analyst
The AnalystIF0
PREAI
ShareSaveShareSaveShareSaveShareSave no more
no more