Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach

DOI10.1007/978-3-642-13520-0_19zbMath1285.68157OpenAlexW1483423010MaRDI QIDQ3569929

Emmanuel Hebrard, Diarmuid Grimes

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_19

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ Underground mine scheduling of mobile machines using constraint programming and large neighborhood search ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ Large-scale periodic scheduling in time-sensitive networks ⋮ An efficient filtering algorithm for the unary resource constraint with transition times and optional activities

This page was built for publication: Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach