Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1

DOI10.1080/00207549608905100zbMath0919.90077OpenAlexW4233978341MaRDI QIDQ4230318

B. Sharadapriyadarshini, Chandrasekharan Rajendran

Publication date: 1 March 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549608905100

zbMATH Keywords

permutation flowshopbuffer-constrained flowshopflowline-based manufacturing celltime-tabling of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking

Cites Work

• Unnamed Item
• A new heuristic method for the flow shop sequencing problem
• Optimal two- and three-stage production schedules with setup times included
• Flowshop sequencing problems with limited buffer storage
• An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
• ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
• An Evaluation of Flow Shop Sequencing Heuristics
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem