Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy

DOI10.1057/jors.1993.142zbMath0783.90053OpenAlexW2030558667MaRDI QIDQ4273247

Jerzy Kyparisis, Christos Douligeris

Publication date: 2 January 1994

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

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

zbMATH Keywords

branch-and-boundtotal flow timeminimum number of tardy jobsoptimal selection of jobssequencing \(N\) jobs on a single machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine

This page was built for publication: Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy