Publication:4849545
From MaRDI portal
zbMath0837.90068MaRDI QIDQ4849545
Publication date: 4 October 1995
job shop scheduling; non-preemptive scheduling; school time tabling; time and resource constrained scheduling problem
90B35: Deterministic scheduling theory in operations research
Related Items
A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, Solving the open shop scheduling problem, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Principles for the design of large neighborhood search, Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search, A case study of mutual routing-scheduling reformulation, A branch and bound method for the job-shop problem with sequence-dependent setup times, Heuristics for scheduling with inventory: Dynamic focus via constraint criticality, Backtracking algorithms for disjunctions of temporal constraints, Constraint-directed techniques for scheduling alternative activities, Constraint propagation techniques for the disjunctive scheduling problem, On not-first/not-last conditions in disjunctive scheduling, Resource-constrained project scheduling: Notation, classification, models, and methods, Metaheuristics: A bibliography, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, A theoretic and practical framework for scheduling in a stochastic environment
