Handling precedence constraints in scheduling problems by the sequence pair representation

DOI10.1007/S10878-015-9973-8MaRDI QIDQ511691zbMATH OpenOpenAlexWikidataFDO

Authors Andrzej Kozik

Publication date 22 February 2017

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

Copyright license Creative Commons Attribution 4.0 International

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

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

Recommendations

• Review of properties of different precedence graphs for scheduling problems
• Single Machine Scheduling with Series-Parallel Precedence Constraints
• Machine scheduling with soft precedence constraints
• scientific article; zbMATH DE number 1264301
• scientific article; zbMATH DE number 4181112

Cites work

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

Cited in

(12)

• Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm
• Sequencing with ordered criteria, precedence and group technology constraints
• scientific article; zbMATH DE number 5260973 (Why is no real title available?)
• Scheduling under the network of temporo-spatial proximity relationships
• Quasi-PTAS for scheduling with precedences using LP hierarchies
• On dual based lower bounds for the sequential ordering problem with precedences and due dates
• Computational Science – ICCS 2005
• Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
• scientific article; zbMATH DE number 5605136 (Why is no real title available?)
• Solving an integrated cell formation and group layout problem using a simulated annealing enhanced by linear programming
• Normal-form preemption sequences for an open problem in scheduling theory
• scientific article; zbMATH DE number 3883928 (Why is no real title available?)

Describes a project that uses

Uses Software

• Hyperheuristics

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

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