Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process

Article Abstract:

Search heuristics were evaluated in terms of their ability to solve a flowshop scheduling problem in a printed circuit board assembly process with the main objective of minimizing tardiness. The heuristics included the NEH, the Extensive Neighborhood Search method, the Taboo Search method, the Simulated Annealing method and the Rolling Block Optimization algorithm. The simulated annealing and taboo search algorithms outperformed all other search algorithms, with simulated annealing providing the best results.

Scheduling (Management), Search theory

---

Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems

Article Abstract:

Research into the part input sequencing problem in general flexible manufacturing systems with the goal of minimizing makespan is presented. It was possible to develop a two-stage approach in which the whole problem is decomposed into the input part grouping problem and the sequencing problem.

Operations Research, Production Planning & Control, Models, Management, Manufacturing industry, Manufacturing industries, Production control, Production planning

---

A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints

Article Abstract:

A production scheduling problem in a tree-structured assembly system is examined.

Assembly-line methods, Assembly lines

Similar abstracts:

• Abstracts: An iterative procedure for reducing problem size in large scale AHP problems. Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Abstracts: Heuristic algorithms for multiprocessor task scheduling on a two-stage hybrid flow-shop. An improved precedence rule for single machine sequencing problems with quadratic penalty
• Abstracts: Throughput, flow times, and service level in an unreliable assembly system. Coordinated replenishments in inventory systems with correlated demands

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