A 2-OPT procedure to reduce total inspection time in a serial inspection process
From MaRDI portal
Publication:877228
DOI10.1007/s10696-006-9013-1zbMath1141.90373OpenAlexW1979530648MaRDI QIDQ877228
Govindaraj Ramasamy, Jorge F. Valenzuela
Publication date: 19 April 2007
Published in: International Journal of Flexible Manufacturing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10696-006-9013-1
Cites Work
- Unnamed Item
- Unnamed Item
- A new adaptive multi-start technique for combinatorial global optimizations
- Rollout algorithms for stochastic scheduling problems
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- Rollout algorithms for combinatorial optimization
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- An optimization model for selective inspection in serial manufacturing systems
- Scheduling with Random Service Times
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: A 2-OPT procedure to reduce total inspection time in a serial inspection process