Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions

DOI10.1287/MOOR.12.1.22MaRDI QIDQ3760291zbMATH OpenOpenAlexFDO

Authors Clyde l. Monma, Jeffrey B. Sidney

Publication date 1987

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.12.1.22

zbMATH Keywords

decomposition algorithmtotal weighted completion timeleast cost fault detectionprecedence-constrained job sequencingtotal weighted exponential completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• scientific article; zbMATH DE number 3850790
• Sequencing with ordered criteria, precedence and group technology constraints
• scientific article; zbMATH DE number 778418
• Single Machine Scheduling with Series-Parallel Precedence Constraints

Cited in

(13)

• Scheduling problems with partially ordered jobs
• A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
• Hybrid optimization methods for time-dependent sequencing problems
• Methods for optimum and near optimum disassembly sequencing
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
• Optimal Consecutive-k-out-of-n:F Component Sequencing
• Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
• Scheduling results applicable to decision-theoretic troubleshooting
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Scheduling with due date assignment under special conditions on job processing
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• Single machine scheduling with precedence constraints and positionally dependent processing times

This page was built for publication: Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions

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