Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
From MaRDI portal
Publication:3760291
DOI10.1287/moor.12.1.22zbMath0622.90050OpenAlexW2030199135MaRDI QIDQ3760291
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
decomposition algorithmtotal weighted completion timeleast cost fault detectionprecedence-constrained job sequencingtotal weighted exponential completion time
Related Items
On some complexity properties of N-free posets and posets with bounded decomposition diameter, Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation, Scheduling problems with partially ordered jobs, Scheduling with due date assignment under special conditions on job processing, Scheduling results applicable to decision-theoretic troubleshooting, Single machine scheduling with precedence constraints and positionally dependent processing times, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results, A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
