Minimizing the number of late jobs under the group technology assumption

DOI10.1023/A:1009841719644zbMath0967.90048MaRDI QIDQ1304380

Zhaohui Liu, Wen-Ci Yu

Publication date: 22 September 1999

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmnumber of late jobsone-machine schedulinggroup technology assumption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ Group sequencing around a common due date ⋮ A survey of scheduling problems with setup times or costs ⋮ Single machine group scheduling with resource dependent setup and processing times ⋮ Group scheduling with controllable setup and processing times: minimizing total weighted completion time ⋮ A note on the complexity of family scheduling to minimize the number of late jobs ⋮ The complexity of two group scheduling problems