A bi-criteria two-machine flowshop scheduling problem with a learning effect

DOI10.1057/palgrave.jors.2602095zbMath1171.90394MaRDI QIDQ3182665

No author found.

Publication date: 15 October 2009

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602095

zbMATH Keywords

scheduling; two-machine flowshop; total completion time; learning effect; maximum tardiness

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90B35: Deterministic scheduling theory in operations research

Related Items

Single-machine scheduling problems with a sum-of-processing-time-based learning function, Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect, Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations, Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning, A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect, Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration, Single-machine scheduling problems with a learning effect, Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects, Proportionate flowshops with general position-dependent processing times, Some scheduling problems with general position-dependent and time-dependent learning effects, A state-of-the-art review on scheduling with learning effects, A survey on scheduling problems with due windows, Scheduling problems with a common due window assignment: A survey