Scheduling permutation flow shops using the Lagrangian relaxation technique

DOI10.1023/A:1018970020599MaRDI QIDQ1374432zbMATH OpenFDO

Authors Guandong Liu, Peter B. Luh, Richard Resch

Publication date 4 December 1997

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

Full work available at URL https://doi.org/10.1023/A:1018970020599

zbMATH Keywords

inherent duality gapLagrangian relaxationpermutation flow shopsreduced complexity bundle methodseparable integer programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cited in

(6)

• Scheduling job shops with batch machines using the Lagrangian relaxation technique
• A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
• scientific article; zbMATH DE number 1301847 (Why is no real title available?)
• scientific article; zbMATH DE number 232391 (Why is no real title available?)
• A systematic review of permutation flow shop scheduling with due-date-related objectives
• Scheduling a hybrid flowshop with batch production at the last stage

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)