Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis

DOI10.1007/s10472-011-9264-8zbMath1267.68217OpenAlexW2086234025MaRDI QIDQ421447

Stephen F. Smith, Riccardo Rasconi, Angelo Oddi, Amedeo Cesta

Publication date: 23 May 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Solving_Job_Shop_Scheduling_with_Setup_Times_through_Constraint-based_Iterative_Sampling_An_Experimental_Analysis/6560924

zbMATH Keywords

job-shop schedulingsetup timesconstraint-based reasoninggeneralized precedence constraintsrandom-restart

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (4)

An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization

Uses Software

• R
• race

Cites Work

• Unnamed Item
• Unnamed Item
• Job shop scheduling with setup times, deadlines and precedence constraints
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
• Temporal constraint networks
• Benchmarks for shop scheduling problems
• A branch and bound algorithm for the job-shop scheduling problem
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Networks of constraints: Fundamental properties and applications to picture processing
• NP-hardness of shop-scheduling problems with three jobs
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• An advanced tabu search algorithm for the job shop problem
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• A constraint-based method for project scheduling with time windows

This page was built for publication: Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis