The job-shop problem and immediate selection
type: Item
instance of: scholarly article
title: The job-shop problem and immediate selection
zbMATH Open document ID: 0826.90062
DOI: 10.1007/BF02085636
author: Peter Brucker
author: Bernd Jurisch
author: Andreas Krämer
published in: Annals of Operations Research
publication date: 1994-12-01T00:00:00Z
review text: For solving job-shop problems using a branch-and-bound method it is important to introduce order relations before the branching starts in order to reduce the computational effort. This may be done by using immediate selection methods to fix as many order relations as possible. In this article, some new methods for an immediate selection are provided. The methods are tested numerically and the computational results illustrate the effectiveness of the approach.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 698905
zbMATH Keywords: job-shop problems
zbMATH Keywords: branch-and-bound
zbMATH Keywords: order relations
zbMATH Keywords: immediate selection methods
reviewed by: Helmut G. Kahlbacher
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: The one-machine sequencing problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: An existence theorem for packing problems with implications for the computation of optimal machine schedules
full work available at URL: https://doi.org/10.1007/bf02085636
OpenAlex ID: W4236129682
description: scientific article; zbMATH DE number 698905