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/002075499191445zbMath0951.90529OpenAlexW1970238346MaRDI QIDQ4245477

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)

Related Items (3)

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 ⋮ A study on the performance of scheduling rules in buffer-constrained dynamic flowshops

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