One-machine generalized precedence constrained scheduling problems

DOI10.1016/0167-6377(94)90064-7zbMath0823.90066OpenAlexW2086943602MaRDI QIDQ1342279

V. Pereyra

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90064-7

zbMATH Keywords

heuristicsmakespangeneralized precedence constraintsone-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (24)

Scheduling with fuzzy delays and fuzzy precedences. ⋮ Cyclic robot scheduling for 3D printer-based flexible assembly systems ⋮ One-machine generalized precedence constrained scheduling problems ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ An improved heuristic for one-machine scheduling with delays constraints ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ Minimum equivalent precedence relation systems ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ Job-shop scheduling in a body shop ⋮ Weight-based heuristics for constraint satisfaction and combinatorial optimization problems ⋮ Unnamed Item ⋮ A memetic algorithm for the job-shop with time-lags ⋮ Minimizing flowtime for paired tasks ⋮ Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. ⋮ A hybrid framework for over-constrained generalized resource-constrained project scheduling problems ⋮ Local search algorithms for a single-machine scheduling problem with positive and negative time-lags ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ Scheduling chains with identical jobs and constant delays on a single machine ⋮ Single-machine scheduling with an external resource ⋮ Scheduling periodic I/O access with bi-colored chains: models and algorithms ⋮ Optimizing consolidation processes in hubs: the hub-arrival-departure problem ⋮ A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations ⋮ A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-machine generalized precedence constrained scheduling problems
• Fast Approximation Algorithms for Knapsack Problems
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling

This page was built for publication: One-machine generalized precedence constrained scheduling problems