Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
From MaRDI portal
Publication:4060706
DOI10.1287/opre.23.2.283zbMath0304.90058MaRDI QIDQ4060706
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.2.283
90C35: Programming involving graphs or networks
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
Related Items
A branch and bound algorithm for the minimum storage-time sequencing problem, Task scheduling with precedence constraints to minimize the total completion time, The permutahedron of series-parallel posets, On the convexity of precedence sequencing games, A 2-OPT procedure to reduce total inspection time in a serial inspection process, Partially ordered knapsack and applications to scheduling, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, Single machine precedence constrained scheduling is a Vertex cover problem, A decomposition of distributive lattices, On some complexity properties of N-free posets and posets with bounded decomposition diameter, File space utilization in database conversion, Sequencing with general precedence constraints, On the measurement of complexity in activity networks, \(P_ 4\)-trees and substitution decomposition, On batch scheduling of jobs with stochastic service times and cost structures on a single server, On strictly optimal schedules for the cumulative cost-optimal scheduling problem, Base polytopes of series-parallel posets: Linear description and optimization, On the approximability of average completion time scheduling under precedence constraints., A decomposition theory based on a dominance relation and composite jobs, Ranking the vertices of a complete multipartite paired comparison digraph, An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs, Precedence constrained scheduling to minimize sum of weighted completion times on a single machine, \(N\)-extendible posets, and how to minimize total weighted completion time, Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint, Asymptotically optimal schedules for single-server flow shop problems with setup costs and times, Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines, Sensitivity analysis for some scheduling problems, Effective solution of certain problems of theory of schedulings of nets, Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints, Decomposition of Directed Graphs
