Reducing mean flow time in permutation flow shop

DOI10.1057/PALGRAVE.JORS.2602395zbMath1144.90392OpenAlexW2061501243MaRDI QIDQ3519365

João Vitor Moccellin, Marcelo Seido Nagano

Publication date: 14 August 2008

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602395

zbMATH Keywords

schedulingflow shopheuristic algorithmmean flowtime

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs

This page was built for publication: Reducing mean flow time in permutation flow shop