13 research outputs found
Minimizing the Weighted Number of Late Semi-resumable Jobs with Deterministic Machine Availability Constraints
No full textScheduling with Fixed Maintenance, Shared Resources and Nonlinear Feedrate Constraints: A Mine Planning Case Study
No full textAn improved algorithm for the two machine flow shop problem with several availability constraints
No full text
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval
No full textEfficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
No full text
Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time
No full textTwo-agent scheduling with agent specific batches on an unbounded serial batching machine
No full textInternational audienc
The symmetric quadratic knapsack problem: approximation and scheduling applications
No full textThis paper reviews two problems of Boolean non-linear programming: the Symmetric Quadratic Knapsack Problem and the Half-Product Problem. The problems are related since they have a similar quadratic non-separable objective function. For these problems, we focus on the development of fully polynomial-time approximation schemes, especially of those with strongly polynomial time, and on their applications to various scheduling problems
