A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops
Authors
Keywords
Scheduling, No-wait flow shops, Makespan, Total flow time, Construction algorithm, Hungarian penalty based heuristic, Insertion heuristic, Traveling salesman problem, Optimization
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started