A note on sequencing jobs with deadlines problem

DOI10.1016/0377-2217(92)90151-XMaRDI QIDQ1194777zbMATH OpenFDO

Authors Krzysztof Szkatula, Krzysztof Dudzinski

Publication date 11 October 1992

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

Full work available at URL https://doi.org/10.1016/0377-2217(92)90151-X

zbMATH Keywords

greedy algorithmheuristic algorithmssequencing jobs with deadlines

Mathematics Subject Classification ID

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

Recommendations

• Publication:3483070
• Algorithms for Scheduling Independent Tasks
• Minimizing Weighted Completion Times with Deadlines
• A greedy heuristic for the mean tardiness sequencing problem
• Random sequencing jobs with deadlines problem: Growth of the optimal solution values

Cites work

• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Algorithms for Scheduling Independent Tasks
• Exact methods for the knapsack problem and its generalizations
• scientific article; zbMATH DE number 3889280 (Why is no real title available?)
• scientific article; zbMATH DE number 4154197 (Why is no real title available?)
• The selection and scheduling of textile orders with due dates

Cited in

(3)

• Random sequencing jobs with deadlines problem: Growth of the optimal solution values
• Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
• scientific article; zbMATH DE number 4154197 (Why is no real title available?)

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

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