Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances

DOI10.1016/j.ejor.2021.07.002zbMath1490.90130OpenAlexW3188269078MaRDI QIDQ2076814

Lukáš Hejl, Zdeněk Hanzálek, Antonín Novák, Přemysl Šucha

Publication date: 22 February 2022

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.07.002

zbMATH Keywords

schedulingsingle machineweighted number of tardy jobsstrongly correlated instances

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• MCFClass
• RelaxIV

Cites Work

• Unnamed Item
• A binary multiple knapsack model for single machine scheduling with machine unavailability
• Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
• Where are the hard knapsack problems?
• Minimizing the weighted number of tardy jobs on a single machine
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
• A new branch and bound algorithm for minimizing the weighted number of tardy jobs
• Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Algorithms for Scheduling Independent Tasks
• A Computational Study of Search Strategies for Mixed Integer Programming
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• Reducibility among Combinatorial Problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances