Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints

DOI10.1080/02522667.1980.10698657zbMath0462.90044OpenAlexW2316158747MaRDI QIDQ3912345

T. Kurisu

Publication date: 1980

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1980.10698657

zbMATH Keywords

algorithmoptimal sequenceparallel-chain precedence constraintssingle machine general maximum cost problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Sequencing to Minimize the Maximum Job Cost
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Single Machine Job Sequencing with Precedence Constraints
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints