Scheduling permutation flow shops using the Lagrangian relaxation technique

DOI10.1023/A:1018970020599zbMATH Open0890.90105MaRDI QIDQ1374432FDOQ1374432

Authors: Guandong Liu, Peter B. Luh, Richard Resch 

Publication date: 4 December 1997

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

Recommendations

• scientific article; zbMATH DE number 1301847
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Permutation flow shops with exact time lags to minimise maximum lateness
• An alternative framework to Lagrangian relaxation approach for job shop scheduling.
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints

zbMATH Keywords

Lagrangian relaxationseparable integer programminginherent duality gappermutation flow shopsreduced complexity bundle method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (3)

• Title not available (Why is that?)
• Scheduling a hybrid flowshop with batch production at the last stage
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374432)