Flowshop scheduling with identical jobs and uniform parallel machines

Article Abstract:

The 2-stage problem can be solved in polynomial-time and for the number of stages greater than two, the problem is known to be NP-hard. A branch and bound procedure that offers a solution to the 3-stage problem and a fast heuristic method to provide exact solution on sample problems are presented. The developed theoretical bounds indicated that the maximum deviation between the solution generated by the heuristic procedure and the optimal solution is bordered by the maximum processing time of a machine at the second stage, independent of the number of jobs and the processing times at the first and third stages.

Production Mgmt NEC, Production management, Manufacturing industry, Manufacturing industries

---

Algorithms for single machine total tardiness scheduling with sequence dependent setups

Article Abstract:

Two algorithms to solve the problem of scheduling a single machine to reduce total tardiness with sequence dependent setup times are proposed.

Alabama, Interpretation and construction, Algorithms, Algorithm

---

A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

Article Abstract:

Branch and bound algorithms, which are used to find solutions for parallel machine scheduling problem, are presented.

Australia, Usage, Branch and bound algorithms, Sequential machine theory

Similar abstracts:

• Abstracts: The scheduling problem of PCBs for multiple non-identical parallel machines
• Abstracts: The scheduling problem of PCBs for multiple non-identical parallel machines. part 2 Two genetic algorithms to solve a layout problem in the fashion industry
• Abstracts: Dancing with giants. India and China: Asia's FDI magnets
• Abstracts: Hybrid flow-shop scheduling problems with multiprocessor task systems. Equity in international greenhouse gases abatement scenarios: a multicriteria approach
• Abstracts: Single machine scheduling when processing times are correlated normal random variables. A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times

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