Job shop scheduling with beam search
type: Item
instance of: scholarly article
title: Job shop scheduling with beam search
zbMATH Open document ID: 0940.90037
DOI: 10.1016/S0377-2217(98)00319-1
published in: European Journal of Operational Research
publication date: 2000-07-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1358430
zbMATH Keywords: scheduling
zbMATH Keywords: beam search
zbMATH Keywords: job shop
author: Ihsan Sabuncuoglu
author: M. Bayız
MaRDI profile type: Publication
cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: Q4692609
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Q3981972
cites work: A neural network model for scheduling problems
Recommended article: A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
Recommended article: List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
Recommended article: Job Shop Scheduling by Local Search
Recommended article: A recovering beam search algorithm for the single machine just-in-time scheduling problem
Recommended article: A search space analysis of the job shop scheduling problem
Recommended article: Job Shop Scheduling by Simulated Annealing
Recommended article: Problem and Heuristic Space Search Strategies for Job Shop Scheduling
description: scientific article; zbMATH DE number 1358430