A makespan study of the two-machine flowshop scheduling problem with a learning effect
From MaRDI portal
Publication:3021813
DOI10.1080/09720510.2005.10701143zbMath1068.90066OpenAlexW2048922274MaRDI QIDQ3021813
No author found.
Publication date: 21 June 2005
Published in: Journal of Statistics and Management Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720510.2005.10701143
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
A survey on scheduling problems with due windows ⋮ Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms ⋮ A note on flow shop scheduling problems with a learning effect on no-idle dominant machines ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Scheduling problems with a common due window assignment: A survey
This page was built for publication: A makespan study of the two-machine flowshop scheduling problem with a learning effect
