A note on ‘Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’

DOI10.1080/00207549408957095zbMath0903.90103OpenAlexW2071846873MaRDI QIDQ4394389

Michael X. Weng, José A. Ventura

Publication date: 11 June 1998

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549408957095

zbMATH Keywords

flowtimeearlinesssingle machinetardinessdominance propertiesnon-preemptive, independent jobsunrestrictive common due datezero ready times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A quadratic integer programming method for minimizing the mean squared deviation of completion times ⋮ Single machine earliness-tardiness scheduling with resource-dependent release dates

This page was built for publication: A note on ‘Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’