An alternative framework to Lagrangian relaxation approach for job shop scheduling.
type: Item
instance of: scholarly article
title: An alternative framework to Lagrangian relaxation approach for job shop scheduling.
zbMATH Open document ID: 1033.90036
DOI: 10.1016/S0377-2217(02)00470-8
author: Haoxun Chen
author: Peter B. Luh
published in: European Journal of Operational Research
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 1957054
zbMATH Keywords: Scheduling
zbMATH Keywords: job shops
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: manufacturing systems
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: Solving Parallel Machine Scheduling Problems by Column Generation
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Q3995531
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: A computational study of constraint satisfaction for multiple capacitated job shop scheduling
cites work: A Survey of Scheduling Rules
cites work: Dynamic programming and decomposition approaches for the single machine total tardiness problem
cites work: Scheduling with limited machine availability
cites work: Surrogate gradient algorithm for Lagrangian relaxation
description: scientific article; zbMATH DE number 1957054