A note on sequencing jobs with deadlines problem

DOI10.1016/0377-2217(92)90151-XzbMath0762.90036MaRDI QIDQ1194777

Krzysztof Szkatuła, Krzysztof Dudzinski

Publication date: 11 October 1992

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

zbMATH Keywords

greedy algorithmheuristic algorithmssequencing jobs with deadlines

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Random sequencing jobs with deadlines problem: Growth of the optimal solution values

Cites Work

• Exact methods for the knapsack problem and its generalizations
• The selection and scheduling of textile orders with due dates
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Algorithms for Scheduling Independent Tasks
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on sequencing jobs with deadlines problem