Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop

DOI10.1007/s43069-021-00096-7zbMath1476.90122MaRDI QIDQ2241320

Abbasali Jafari-Nodoushan, Reza Tavakkoli-Moghaddam, M. M. Lotfi, Hassan Khademi-Zare

Publication date: 8 November 2021

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-021-00096-7

zbMATH Keywords

scheduling; branch and bound; deteriorating jobs; heuristic; flowshop

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C30: Nonlinear programming

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming