On not-first/not-last conditions in disjunctive scheduling

DOI10.1016/S0377-2217(99)00497-XzbMath0990.90049MaRDI QIDQ1590039

Pierre Lopez, Philippe Torres

Publication date: 19 December 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

branch and boundlower boundsconstraint propagationjob shopedge-findingtime-bound adjustment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Constraint programming and operations research ⋮ Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities ⋮ 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))\) ⋮ Arc-B-consistency of the inter-distance constraint ⋮ Strong polynomiality of resource constraint propagation ⋮ Local adjustments: A general algorithm ⋮ Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results

Uses Software

• JOBSHOP
• BL data set

Cites Work

• Unnamed Item
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Adjustment of heads and tails for the job-shop problem
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Deterministic job-shop scheduling: Past, present and future
• Heuristics for large constrained vehicle routing problems
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• Ordonnancements à contraintes disjonctives
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
• A new approach to computing optimal schedules for the job-shop scheduling problem

This page was built for publication: On not-first/not-last conditions in disjunctive scheduling