Two-machine flowshop scheduling to minimize the number of tardy jobs

DOI10.1057/palgrave.jors.2600346zbMath0888.90090OpenAlexW2037094092MaRDI QIDQ4367035

Jatinder N. D. Gupta, A. M. A. Hariri

Publication date: 25 November 1997

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

zbMATH Keywords

heuristictwo-machine flowshoppolynomially solvable special casestotal number of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes ⋮ Minimizing the weighted number of tardy jobs on a two-machine flow shop. ⋮ Minimizing tardy jobs in a flowshop with common due date

This page was built for publication: Two-machine flowshop scheduling to minimize the number of tardy jobs