Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem

DOI10.1016/j.ejor.2017.03.047zbMath1403.90369OpenAlexW2599653784MaRDI QIDQ1754010

Krzysztof Szkatuła

Publication date: 30 May 2018

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

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

zbMATH Keywords

schedulingcombinatorial optimizationprobabilistic analysisprofitapproximate algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Uses Software

• OpenCourseWare

Cites Work

• Improved integer linear programming formulations for the job sequencing and tool switching problem
• Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
• Random sequencing jobs with deadlines problem: Growth of the optimal solution values
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• Scheduling a single machine to minimize a regular objective function under setup constraints
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• A survey on scheduling problems with due windows
• Algorithms for Scheduling Independent Tasks
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Sequencing jobs on a single machine: A neural network approach
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem