CIM Lectures 2021

Objectives for the SALBP explained.

The algorithm to solve SALBP-1 problem, plus the RPW and WET methods for weights calculation.

RPW and WET solutions for the simple example presented in previous parts.

Two types of problems: SALBP-1 and SALBP-2.

Introduction to Assembly Line Balancing.

Some final remarks on the topic.

Solution for a different sequence of jobs and tasks.

Final remarks on conflicts resolutions, why many solutions are needed, and on a different approach to solve the Job Shop scheduling problem.

Some remarks on heuristic rules used to resolve conflicts.

Scheduling with conflicts in Job Shop systems.

Why the Johnson's algorithm, and the Johnson's rule make no sense for Job Shop systems.

Introduction to the Job Shop systems.

Breaking the Johnson's rule and Flow-Shop summary.

Transformation rules for more machines, with examples.

A different example of 2-machines Flow-Shop problem.

Johnson's rule, algorithm and example.

Flow-Shop system scheme and scheduling problem.

Flow-Shop problem and system introduction.

One more example for preemptive tasks.

Preemptive tasks: use-cases and scheduling algorithm.

RPT and SPT algorithms remarks, on some examples.

Alternate SPT solution, with better makespan.

The LPT algorithm features, with an example.

The RPT and SPT algorithms.

Real-life examples and the LPT algorithm.