Handling precedence constraints in scheduling problems by the sequence pair representation

DOI10.1007/S10878-015-9973-8zbMATH Open1362.90199OpenAlexW2227105022WikidataQ59609614 ScholiaQ59609614MaRDI QIDQ511691FDOQ511691

Authors: 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

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

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)

Cites Work

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

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
• Title not available (Why is that?)
• Quasi-PTAS for scheduling with precedences using LP hierarchies
• Scheduling under the network of temporo-spatial proximity relationships
• Computational Science – ICCS 2005
• On dual based lower bounds for the sequential ordering problem with precedences and due dates
• Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)