Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem

DOI10.1007/978-3-319-39384-1_36zbMath1358.90043OpenAlexW2480944582MaRDI QIDQ2814143

Mieczyslaw Wodecki, Wojciech Bożejko, Mariusz Uchroński

Publication date: 17 June 2016

Published in: Artificial Intelligence and Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39384-1_36

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 (2)

An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ Algorithm for solving the Discrete-Continuous Inspection Problem

Cites Work

• Using fuzzy set theory in a scheduling problem: A case study
• Routing and scheduling in a flexible job shop by tabu search
• On the theoretical properties of swap multimoves
• Ready-Time Scheduling with Stochastic Service Times

This page was built for publication: Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem