Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation

DOI10.1007/s10878-023-01046-1zbMath1527.90100OpenAlexW4378533253MaRDI QIDQ6110962

M. Hajibabaei, J. Behnamian

Publication date: 6 July 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01046-1

zbMATH Keywords

Lagrangian relaxationflexible job-shop scheduling problemassembly stagecleaner production

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cites Work

• A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
• Scheduling job shops with batch machines using the Lagrangian relaxation technique
• An alternative framework to Lagrangian relaxation approach for job shop scheduling.
• Solving the flexible job shop scheduling problem with sequence-dependent setup times
• Some similarity measures for triangular fuzzy number and their applications in multiple criteria group decision-making
• Lagrangian bounds for just-in-time job-shop scheduling
• A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
• A genetic algorithm for flexible job shop scheduling with fuzzy processing time
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Fuzzy sets
• The traveling-salesman problem and minimum spanning trees: Part II
• A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time

This page was built for publication: Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation