OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS

DOI10.15807/JORSJ.26.226zbMath0524.90049OpenAlexW2338267647MaRDI QIDQ3037112

Yasuki Sekiguchi

Publication date: 1983

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

Full work available at URL: https://doi.org/10.15807/jorsj.26.226

zbMATH Keywords

algorithmgroup technologylag timeset-up timesminimization of maximum completion timetwo-machine permutation flow-shopseries- parallel precedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

A comprehensive review of flowshop group scheduling literature ⋮ A sequencing problem with family setup times ⋮ Multi-family scheduling in a two-machine reentrant flow shop with setups ⋮ A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups ⋮ Johnson's rule, composite jobs and the relocation problem ⋮ A decomposition theory based on a dominance relation and composite jobs ⋮ Two-machine flowshop group scheduling problem

This page was built for publication: OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS