TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS

DOI10.15807/JORSJ.20.113zbMATH Open0367.90076OpenAlexW320500344MaRDI QIDQ4145412FDOQ4145412

T. Kurisu

Publication date: 1977

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.20.113

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• Clustered flow shop models
• Multipermutations and Stirling multipermutations
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• Algorithms for two-machine flow-shop sequencing with precedence constraints

This page was built for publication: TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS

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