A note on combined job selection and sequencing problems

DOI10.1002/NAV.21543MaRDI QIDQ4629186zbMATH OpenOpenAlexFDO

Authors C. Koulamas, S. S. Panwalkar

Publication date 26 March 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21543

zbMATH Keywords

outsourcingschedulingsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy
• Minimizing the weighted number of tardy jobs on a single machine
• A branch and bound algorithm to minimize total weighted tardiness on a single processor
• scientific article; zbMATH DE number 123937
• The optimum with the shortest total processing time of on-time jobs

Cited in

(3)

• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
• On the fine-grained parameterized complexity of partial scheduling to minimize the makespan

This page was built for publication: A note on combined job selection and sequencing problems

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