Discrepancy search for the flexible job shop scheduling problem
type: Item
instance of: scholarly article
title: Discrepancy search for the flexible job shop scheduling problem
zbMATH Open document ID: 1231.90176
author: Abir Ben Hmida
author: Mohamed Haouari
author: Marie-José Huguet
author: Pierre Lopez
published in: Computers \& Operations Research
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5780054
zbMATH Keywords: scheduling
zbMATH Keywords: allocation
zbMATH Keywords: flexible job shop
zbMATH Keywords: discrepancy search
zbMATH Keywords: neighborhood structures
MaRDI profile type: Publication
full work available at URL: j.cor.2010.03.009
OpenAlex ID: W2023444009
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Effective neighbourhood functions for the flexible job shop problem
cites work: A genetic algorithm for the flexible job-shop scheduling problem
cites work: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
cites work: Q4882527
cites work: Job-shop scheduling with multi-purpose machines
cites work: Routing and scheduling in a flexible job shop by tabu search
cites work: Tabu search for the job-shop scheduling problem with multi-purpose machines
cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
cites work: Parallel machine scheduling with precedence constraints and setup times
cites work: Variable neighborhood search: Principles and applications
DOI: 10.1016/J.COR.2010.03.009
description: scientific article; zbMATH DE number 5780054