Scheduling permutation flow shops using the Lagrangian relaxation technique

DOI10.1023/A:1018970020599zbMath0890.90105MaRDI QIDQ1374432

Guandong Liu, Peter B. Luh, Richard Resch

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationseparable integer programminginherent duality gappermutation flow shopsreduced complexity bundle method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time

This page was built for publication: Scheduling permutation flow shops using the Lagrangian relaxation technique