Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time

DOI10.1057/palgrave.jors.2601638zbMath1181.90115OpenAlexW2015791519MaRDI QIDQ4661237

No author found.

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.2601638

zbMATH Keywords

lower boundshierarchical criteriaparallel machine schedulingmaximum tardinessflow-timetardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs ⋮ A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ Impact of worker and shop flexibility on assembly cells ⋮ Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness ⋮ Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs

This page was built for publication: Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time