Minimization of the makespan in a two-machine problem under given resource constraints

Article Abstract:

The two-machine flow-shop problem was investigated in terms of lessening its job processing times and allocating its limited resources to individual jobs. Consideration was given with regards to linearly lessening the problem's job processing times through the use of a limited, continuously divisible resources such as financial outlay and energy. It was revealed that the problem's decision form is NP-complete even when job processing times on one machine are fixed and the job reduction rates on the other are alike.

Production Planning & Control, Research, Analysis, Algorithms, Manufacturing processes, Manufacturing, Production control, Linear models (Statistics)

---

A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation

Article Abstract:

An effective heuristic algorithm to solve scheduling problem, in a hybrid flow shop with recirculation, which has to perform jobs between a release date and a due date to minimize the weighted number of tardy jobs, is proposed. To evaluate the heuristics experiences on instances in industry are computed and the efficiency established.

Production Management, Methods, Scheduling (Management), Heuristic programming

---

Similar abstracts:

• Abstracts: Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption
• Abstracts: Innovation, market structure and the holdup problem: investment incentives and coordination. Timing of investments, holdup and total welfare
• Abstracts: Predation due to adverse selection in financial markets. Nonlinear price discrimination with a finite number of consumers and constrained recontracting
• Abstracts: Play it again. The net becomes a news source
• 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.