scientific article; zbMATH DE number 802345
From MaRDI portal
Publication:4849545
zbMath0837.90068MaRDI QIDQ4849545
Publication date: 4 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
job shop schedulingnon-preemptive schedulingschool time tablingtime and resource constrained scheduling problem
Related Items (26)
Constraint programming and operations research ⋮ Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ Heuristics for scheduling with inventory: Dynamic focus via constraint criticality ⋮ Principles for the design of large neighborhood search ⋮ Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) ⋮ Metaheuristics: A bibliography ⋮ A case study of mutual routing-scheduling reformulation ⋮ Redundant cumulative constraints to compute preemptive bounds ⋮ Constraint propagation on GPU: a case study for the cumulative constraint ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem ⋮ Explaining the \texttt{cumulative} propagator ⋮ A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem ⋮ Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics ⋮ A branch and bound method for the job-shop problem with sequence-dependent setup times ⋮ Solving the open shop scheduling problem ⋮ A theoretic and practical framework for scheduling in a stochastic environment ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ Constraint-directed techniques for scheduling alternative activities ⋮ Constraint propagation techniques for the disjunctive scheduling problem ⋮ Streamlining variational inference for constraint satisfaction problems ⋮ On not-first/not-last conditions in disjunctive scheduling ⋮ A quadratic edge-finding filtering algorithm for cumulative resource constraints ⋮ Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
This page was built for publication:
