Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances
Authors:
- Lukáš HejlLHLukáš Hejl
- Přemysl ŠůchaPŠPřemysl Šůcha
- Antonín NovákANAntonín Novák
- Zdeněk HanzálekZHZdeněk Hanzálek
- 1 April 2022
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 298 (2) , 413-424
Abstract
No abstract availableKeywords
Funding Information
- European Commission
- Ministerstvo Školství, Mládeže a Tělovýchovy (CZ.02.1.01/0.0/0.0/16_026/0008432)
- European Regional Development Fund (CZ.02.1.01/0.0/0.0/15_003/0000466)
This publication has 18 references indexed in Scilit:
- Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobsOmega, 2019
- Parallel tabu search for the cyclic job shop scheduling problemComputers & Industrial Engineering, 2017
- A binary multiple knapsack model for single machine scheduling with machine unavailabilityComputers & Operations Research, 2016
- An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenanceInternational Journal of Production Research, 2015
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper boundsRAIRO - Operations Research, 2013
- Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instancesJournal of Scheduling, 2008
- A Computational Study of Search Strategies for Mixed Integer ProgrammingINFORMS Journal on Computing, 1999
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy JobsManagement Science, 1994
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968