Inverse scheduling with maximum lateness objective
From MaRDI portal
Recommendations
- A note on reverse scheduling with maximum lateness objective
- Stochastic scheduling to minimize expected maximum lateness
- The inverse parallel machine scheduling problem with minimum total completion time
- A note on generalizing the maximum lateness criterion for scheduling
- Min-max relative regret for scheduling to minimize maximum lateness
- Interval scheduling: A survey
- Inverse interval scheduling via reduction on a single machine
- Rescheduling to minimize maximum lateness under a limit on the makespan of the original jobs
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Inverse problems of single machine scheduling on processing times of jobs
Cites work
- scientific article; zbMATH DE number 1302182 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Inverse Optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow problems under the weighted Hamming distance
- Necessary and sufficient conditions of optimality for some classical scheduling problems
- Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity
- Some inverse optimization problems under the Hamming distance
Cited in
(11)- A note on reverse scheduling with maximum lateness objective
- A characterization of optimal multiprocessor schedules and new dominance rules
- Inverse optimization in semi-definite programs to impute unknown constraint matrices
- Inferring linear feasible regions using inverse optimization
- Inverse optimization for the recovery of constraint parameters
- Improved approaches to the exact solution of the machine covering problem
- An inverse optimization approach for a capacitated vehicle routing problem
- The inverse parallel machine scheduling problem with minimum total completion time
- Inverse problems of single machine scheduling on processing times of jobs
- Inverse scheduling: Two-machine flow-shop problem
- An improved genetic algorithm for single-machine inverse scheduling problem
This page was built for publication: Inverse scheduling with maximum lateness objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041341)
