Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances

DOI10.1007/S10951-008-0092-6zbMath1185.90065OpenAlexW2000672358MaRDI QIDQ969755

Philippe Baptiste, Andrea Grosso, Frederico Della Croce, Vincent T'kindt

Publication date: 7 May 2010

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-008-0092-6

zbMATH Keywords

single machinedeadlinestardy jobssequencing and scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

MP or not MP: that is the question ⋮ Scheduling evacuation operations ⋮ Unary NP-hardness of minimizing the number of tardy jobs with deadlines ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Preprocessing for a map sectorization problem by means of mathematical programming ⋮ Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem ⋮ An exact approach for scheduling jobs with regular step cost functions on a single machine ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances

Cites Work

• Unnamed Item
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• Minimizing the weighted number of tardy jobs on a single machine
• An exact method to minimize the number of tardy jobs in single machine scheduling
• Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Computational Study of Search Strategies for Mixed Integer Programming
• Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances