MILP models for the optimization of real production lines

DOI10.1007/s10100-014-0337-8zbMath1339.90246OpenAlexW2078155497MaRDI QIDQ302141

Zoltán Horváth, Tamás Hajba

Publication date: 4 July 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-014-0337-8

zbMATH Keywords

computational comparisonsflow shop schedulingminimizing makespanmixed integer programming formulations

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Editorial

Cites Work

• Unnamed Item
• Unnamed Item
• New effective MILP models for PFSPs arising from real applications
• A cutting plane approach for integrated planning and scheduling
• A computational study of the permutation flow shop problem based on a tight lower bound
• Two models for a family of flowshop sequencing problems
• Benchmarks for basic scheduling problems
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
• MIP Formulations for Flowshop Scheduling with Limited Buffers
• New MILP models for the permutation flowshop problem
• Comparative evaluation of MILP flowshop models

This page was built for publication: MILP models for the optimization of real production lines