Minimizing the number of late jobs under the group technology assumption

DOI10.1023/A:1009841719644MaRDI QIDQ1304380zbMATH OpenFDO

Authors Zhaohui Liu, Wen-Ci Yu

Publication date 22 September 1999

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

Full work available at URL https://doi.org/10.1023/A:1009841719644

zbMATH Keywords

group technology assumptionnumber of late jobsone-machine schedulingpolynomial time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The complexity of two group scheduling problems
• Two scheduling problems in group technology with deteriorating jobs
• Group sequencing around a common due date
• scientific article; zbMATH DE number 2219118
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time

Cited in

(7)

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

This page was built for publication: Minimizing the number of late jobs under the group technology assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304380)