Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach

Article Abstract:

The issue of scheduling jobs on parallel machines to reduce the makespan, which is total completion time, is considered. Recovering Beam Search algorithm is used to solve the problem and the derived computational results are presented.

United Kingdom, Italy, Science & research, Methods, Usage, Search theory

---

A branch and bound algorithm for the two-stage assembly scheduling problem

Article Abstract:

A branch and bound algorithm was developed to solve the problem of scheduling a two-stage assembly of limiting the makespan. The algorithm also aims to schedule the jobs on the machines to allow maximum completion time to be limited. It was established that numerous dominance theorems have been developed and integrated into the branh and bound algorithm.

Production Management, Management, Assembly-line methods, Assembly lines, Branch and bound algorithms

---

Similar abstracts:

• Abstracts: Flow shop and open shop scheduling with a critical machine and two operations per job. A note on scheduling flowshops with flexible stage ordering
• Abstracts: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Abstracts: Selective maintenance for support equipment involving multiple maintenance actions. A combinatorial approach to level of repair analysis
• Abstracts: Analysis of supplier buyer relationships using resource constrained project scheduling strategies. An extended enterprise planning methodology for the discrete manufacturing industry
• Abstracts: Coordinating supply chain inventories through common replenishment epochs. A continuous model for production-distribution system design

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