A computational study of constraint satisfaction for multiple capacitated job shop scheduling

DOI10.1016/0377-2217(95)00354-1zbMath0916.90152OpenAlexW2168328014MaRDI QIDQ1266543

Emile H. L. Aarts, W. P. M. Nuijten

Publication date: 7 October 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00354-1

zbMATH Keywords

consistency checkingmultiple capacitated job shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Constraint programming and operations research ⋮ Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ An alternative framework to Lagrangian relaxation approach for job shop scheduling. ⋮ Strong polynomiality of resource constraint propagation ⋮ A filter-and-fan approach to the job shop scheduling problem ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Constraint satisfaction problems: Algorithms and applications ⋮ A computational study of constraint satisfaction for multiple capacitated job shop scheduling ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem ⋮ Minimizing makespan on parallel machines subject to release dates and delivery times ⋮ Tabu search for resource-constrained scheduling

Uses Software

• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Unnamed Item
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Consistency in networks of relations
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• Networks of constraints: Fundamental properties and applications to picture processing
• The Complexity of Flowshop and Jobshop Scheduling
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Job Shop Scheduling by Local Search

This page was built for publication: A computational study of constraint satisfaction for multiple capacitated job shop scheduling