A Lagrangean relaxation approach for the mixed-model flow line sequencing problem

DOI10.1016/j.cor.2006.05.011zbMath1278.90152OpenAlexW2071606084WikidataQ58644698 ScholiaQ58644698MaRDI QIDQ2456653

Deniz Türsel Eliiyi, Melih Özlen

Publication date: 19 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://researchrepository.rmit.edu.au/view/delivery/61RMIT_INST/12247654520001341/13248429860001341

zbMATH Keywords

Lagrangean relaxationmakespanmixed-model flow lines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan

Cites Work

• Unnamed Item
• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• Algorithms for real-time scheduling of jobs on mixed model assembly lines
• Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
• A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines
• Optimal two- and three-stage production schedules with setup times included
• Stochastic cyclic scheduling problem in synchronous assembly and production lines
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Comparative Study of Flow-Shop Algorithms
• The Complexity of Flowshop and Jobshop Scheduling
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Design configuration for a closed-station, mixed-model assembly line: A filing cabinet manufacturing system
• Mixed-Model Sequencing to Minimize Utility Work and the Risk of Conveyor Stoppage
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: A Lagrangean relaxation approach for the mixed-model flow line sequencing problem