Simulated annealing for order spread minimization in sequencing cutting patterns

Article Abstract:

A new version of simulated annealing (SA) was created to solve a sequencing problem called Order Spread Minimization Problem (OSMP) that results from industrial cutting operations planning. The developed SA generates faster computing times and higher solution quality than that of Madsen's approach. Its solution quality can be compared to those produced by the traditional 3-opt-procedure.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Simulated annealing (Mathematics)

---

Solution of a large-scale two-stage decision and scheduling problem using decomposition

Article Abstract:

Research is presented concerning the development of a decomposition based tree search heuristic for the resolution of two-stage decision and scheduling problems which exist in production environments.

Operations Research, Decomposition method

---

The CLWS heuristic for single machine scheuling problem

Article Abstract:

Issues relating to scheduling problems for single machines are examined in detail, with the CLWS heuristic set out and compared with alternatives.

Management Theory & Techniques, Management

Similar abstracts:

• Abstracts: A dominant subset of V-shaped sequences for a class of single machine sequencing problems. Comparing the efficacy of ranking methods for multiple round-robin tournaments
• Abstracts: The struggle for strategic alignment in multinational corporations: managing readjustment during global expansion
• Abstracts: Optimium target values for two machines in series with 100% inspection. A model for parallel machine replacement with capacity expansion
• Abstracts: Submodularity and the travelling salesman problem. An adaptive approach to controlling kanban systems. The Kanban assignment problem - a non-integral approach

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.