A decomposition theory based on a dominance relation and composite jobs

DOI10.1016/0166-218X(87)90012-6zbMath0614.90057MaRDI QIDQ1820683

Yasuki Sekiguchi

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositionsequencingone-machine minimum total weighted-completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS
• The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
• The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
• Sequencing with Series-Parallel Precedence Constraints
• ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES
• A Decomposition Algorithm for Sequencing with General Precedence Constraints
• A Remark on Search and Sequencing Problems
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

This page was built for publication: A decomposition theory based on a dominance relation and composite jobs