Inverse scheduling: Two-machine flow-shop problem
From MaRDI portal
Publication:640308
DOI10.1007/S10951-010-0168-YzbMATH Open1222.90013OpenAlexW2056591424WikidataQ59902916 ScholiaQ59902916MaRDI QIDQ640308FDOQ640308
Peter Brucker, N. 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
Recommendations
- On two-machine flow shop scheduling
- Two-machine flow-shop scheduling problems with minimizing the total completion times
- Two machines flowshop scheduling problem with disintegration consideration
- Two-machine flow shop scheduling problem under linear constraints
- Inverse problems of single machine scheduling on processing times of jobs
- Two-machine flowshop batching and scheduling
- The two-machine sequence dependent flowshop scheduling problem
- The two-machine flowshop scheduling problem with total tardiness
- The two-machine total completion time flow shop problem
- Two-machine flowshop scheduling to minimize mean flow time
Optimality conditions and duality in mathematical programming (90C46) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow problems under the weighted Hamming distance
- Optimal two- and three-stage production schedules with set-up time included
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Inverse Optimization
- Necessary and sufficient conditions of optimality for some classical scheduling problems
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Some inverse optimization problems under the Hamming distance
- Title not available (Why is that?)
- Inverse scheduling with maximum lateness objective
- Title not available (Why is that?)
- Cutting plane algorithms for the inverse mixed integer linear programming problem
Cited In (4)
- 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
- An improved genetic algorithm for single-machine inverse scheduling problem
This page was built for publication: Inverse scheduling: Two-machine flow-shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640308)
