Handling precedence constraints in scheduling problems by the sequence pair representation

DOI10.1007/s10878-015-9973-8zbMath1362.90199OpenAlexW2227105022WikidataQ59609614 ScholiaQ59609614MaRDI QIDQ511691

Andrzej Kozik

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9973-8

zbMATH Keywords

schedulingprecedence constraintsrectangle packing problemsequence pair

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm ⋮ Solving an integrated cell formation and group layout problem using a simulated annealing enhanced by linear programming

Uses Software

• Hyperheuristics

Cites Work

• The chord length of a hypercycle in a hyperbolic plane of positive curvature
• Scheduling malleable tasks with precedence constraints
• New perspectives in VLSI design automation: deterministic packing by sequence pair
• Strip packing with precedence constraints and strip packing with release times
• On the complexity of adjacent resource scheduling
• Hybrid metaheuristics. An emerging approach to optimization.
• On computing the length of longest increasing subsequences
• Scheduling multiprocessor tasks -- An overview
• Local search algorithms for the rectangle packing problem with general spatial costs
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Two-dimensional packing problems: a survey
• Parallel dedicated machines scheduling with chain precedence constraints
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• Hardness of Precedence Constrained Scheduling on Identical Machines
• Complex Scheduling
• A fast algorithm for computing longest common subsequences
• Design and implementation of an efficient priority queue
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Computing and Combinatorics
• Optimal Rectangle Packing: An Absolute Placement Approach
• Approximation Algorithms for Scheduling Parallel Jobs

This page was built for publication: Handling precedence constraints in scheduling problems by the sequence pair representation