Inverse scheduling: Two-machine flow-shop problem
From MaRDI portal
Publication:640308
DOI10.1007/s10951-010-0168-yzbMath1222.90013WikidataQ59902916 ScholiaQ59902916MaRDI QIDQ640308
Peter Brucker, Natalia V. Shakhlevich
Publication date: 18 October 2011
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/81533/1/InvFlowShop-BruckerShakhlevich.pdf
90C46: Optimality conditions and duality in mathematical programming
90B35: Deterministic scheduling theory in operations research
Related Items
The inverse parallel machine scheduling problem with minimum total completion time, An improved genetic algorithm for single-machine inverse scheduling problem, Improved approaches to the exact solution of the machine covering problem
Cites Work
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions of optimality for some classical scheduling problems
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Inverse scheduling with maximum lateness objective
- 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
- Optimal two- and three-stage production schedules with setup times included
- Inverse Optimization
- Inverse Problem Theory and Methods for Model Parameter Estimation
