Sequencing CONWIP flow-shops: Analysis and heuristics

DOI10.1080/00207540110048972zbMath1060.90557OpenAlexW2135208838MaRDI QIDQ4674420

Rafael Ruiz-Usano, Jose M. Framinan, Rainer Leisten

Publication date: 11 May 2005

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

Full work available at URL: http://hdl.handle.net/10419/48887

zbMATH Keywords

heuristicsflow-shop problembacklog sequencing problemproduction control system

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (4)

Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ A study on the performance of scheduling rules in buffer-constrained dynamic flowshops

This page was built for publication: Sequencing CONWIP flow-shops: Analysis and heuristics