Temporal constraint satisfaction techniques in job shop scheduling problem solving
type: Item
instance of: scholarly article
title: Temporal constraint satisfaction techniques in job shop scheduling problem solving
zbMATH Open document ID: 0911.68188
DOI: 10.1023/A:1009777711218
author: Saïd Belhadji
author: Amar Isli
published in: Constraints
publication date: 1999-03-09T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1230476
zbMATH Keywords: fragmentation problem
zbMATH Keywords: job shop scheduling
MaRDI profile type: Publication
full work available at URL: a:1009777711218
OpenAlex ID: W1853816584
Recommended article: Applying constraint satisfaction techniques to job shop scheduling
Recommended article: Q4849545
Recommended article: Constraint Propagation Based Scheduling of Job Shops
Recommended article: The job shop scheduling problem: Conventional and new solution techniques
Recommended article: Q4551179
Recommended article: Solving transient scheduling problems with constraint programming
Recommended article: Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
Recommended article: Q3095714
Recommended article: Q3152950
description: scientific article; zbMATH DE number 1230476