Analysis of the feasible domain of ELSP problems based on hybrid algorithms

zbMATH Open1363.90100MaRDI QIDQ2951237FDOQ2951237

Qi Wang, Qin Zhang, Shenshan Qiu, Zhong Xie

Publication date: 6 January 2017

Recommendations

• Hybrid genetic algorithm for the economic lot-scheduling problem
• An improved algorithm for solving the economic lot size problem (ELSP)
• A search heuristic for the sequence-dependent economic lot scheduling problem
• The economic lot scheduling problem -- survey and LP-based method
• Testing Feasibility in a Lot Scheduling Problem

zbMATH Keywords

genetic algorithmsrecurrent neural networkhybrid algorithmseconomic lot scheduling problemthe feasible domain

Mathematics Subject Classification ID

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

This page was built for publication: Analysis of the feasible domain of ELSP problems based on hybrid algorithms

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