Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers

DOI10.1080/002075499191445zbMATH Open0951.90529OpenAlexW1970238346MaRDI QIDQ4245477FDOQ4245477

Authors Chandrasekharan Rajendran 

Publication date 8 June 1999

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

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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 2
• Scheduling in a Kanban-controlled flowshop with dual blocking mechanisms and missing operations for part-types
• Heuristic for scheduling in a Kanban system with dual blocking mechanisms
• Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 1

Cited In (5)

• A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
• Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
• An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy
• Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 1
• Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 2

This page was built for publication: Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245477)