Back to search
Optimal flowshop schedules with no intermediate storage space
Data up to Jan 2025
Published1976
Citations56
References9
Total Citations Per Year
Abstract
References (9)
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
1964 • 551 citations
The Traveling Salesman Problem: A Survey
1968 • 389 citations
The Traveling Salesman Problem: A Survey
1976 • 381 citations
On the Flow-Shop Sequencing Problem with No Wait in Process†
1972 • 241 citations
Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
1972 • 225 citations
Review of sequencing research
1970 • 150 citations
The machine sequencing problem – review and extensions
1968 • 91 citations
The Sequencing Problem
1969 • 41 citations
M-stage scheduling problem—a critical appraisal
1971 • 35 citations
Cited By (0)
Loading...