Parallel machine scheduling with common due windows

DOI10.1057/jors.2008.184zbMath1230.90090OpenAlexW2071943246MaRDI QIDQ4929846

No author found.

Publication date: 24 September 2010

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

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

zbMATH Keywords

parallel machinedue windowsoperation schedulingon-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

A survey on scheduling problems with due windows ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ Clarifying cutting and sewing processes with due windows using an effective ant colony optimization ⋮ Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach ⋮ Due-window assignment with identical jobs on parallel uniform machines

This page was built for publication: Parallel machine scheduling with common due windows