Inverse scheduling with maximum lateness objective

DOI10.1007/s10951-009-0117-9zbMath1176.90195OpenAlexW1968390493WikidataQ60500839 ScholiaQ60500839MaRDI QIDQ1041341

Peter Brucker, Natalia V. Shakhlevich

Publication date: 2 December 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/5413/1/shakhlevitchn4.pdf

zbMATH Keywords

single-machine schedulingmaximum latenessinverse optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A characterization of optimal multiprocessor schedules and new dominance rules ⋮ Improved approaches to the exact solution of the machine covering problem ⋮ The inverse parallel machine scheduling problem with minimum total completion time ⋮ A note on reverse scheduling with maximum lateness objective ⋮ Inverse scheduling: Two-machine flow-shop problem ⋮ An improved genetic algorithm for single-machine inverse scheduling problem ⋮ An inverse optimization approach for a capacitated vehicle routing problem ⋮ Inferring linear feasible regions using inverse optimization ⋮ Inverse optimization for the recovery of constraint parameters

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Inverse combinatorial optimization: a survey on problems, methods, and results
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• Inverse maximum flow problems under the weighted Hamming distance
• Some inverse optimization problems under the Hamming distance
• Inverse Optimization

This page was built for publication: Inverse scheduling with maximum lateness objective