A nonlinear mixed integer goal programming model for the two-machine closed flow shop

DOI10.1016/0377-2217(91)90191-WzbMath0739.90033OpenAlexW2032399461MaRDI QIDQ1183613

S. Singh

Publication date: 28 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90191-w

zbMATH Keywords

makespanlot sizingmean flow timemean tardinessdeterministic static two-machine closed flow shopnonlinear mixed integer goal programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Multiple machine JIT scheduling: a tabu search approach ⋮ On multiobjective combinatorial optimization and dynamic interim hedging of efficient portfolios

Uses Software

• PAGP

Cites Work

• Unnamed Item
• Unnamed Item
• A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
• On the interactive solution to a multicriteria scheduling problem
• PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems

This page was built for publication: A nonlinear mixed integer goal programming model for the two-machine closed flow shop