Due-date assignment with asymmetric earliness–tardiness cost
From MaRDI portal
Publication:4661193
DOI10.1057/palgrave.jors.2601624zbMath1095.90553OpenAlexW2066741055MaRDI QIDQ4661193
Publication date: 4 April 2005
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.2601624
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
A new perspective on single-machine scheduling problems with late work related criteria, Scheduling job classes on uniform machines, Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs, Scheduling with a common due-window: polynomially solvable cases