Generalized pairwise interchanges and machine scheduling
type: Item
instance of: scholarly article
title: Generalized pairwise interchanges and machine scheduling
zbMATH Open document ID: 0904.90085
DOI: 10.1016/0377-2217(95)00009-F
published in: European Journal of Operational Research
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1162844
zbMATH Keywords: pairwise interchange
zbMATH Keywords: neighborhood search
zbMATH Keywords: machine scheduling
zbMATH Keywords: branch-and-bound
zbMATH Keywords: dominance properties
author: F. Della Croce
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4658190
cites work: Minimising makespan in the two-machine flow-shop with release times
cites work: The two-machine total completion time flow shop problem
cites work: Q4859582
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Q3938812
cites work: A new lower bound approach for single-machine multicriteria scheduling
cites work: Q3995531
cites work: Parametric precedence relations in single machine scheduling
cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
cites work: Job Shop Scheduling by Simulated Annealing
full work available at URL: 0377-2217(95)00009-f
OpenAlex ID: W2048562612
description: scientific article; zbMATH DE number 1162844