author.DisplayName 1 author.DisplayName 1 author.DisplayName 2 author.DisplayName 3
1Industrial Engineering and Management, Ariel University, ישראל
2Physics, SCE - Shamoon College of Engineering, ישראל
3Industrial Engineering and Management, SCE - Shamoon College of Engineering, ישראל

We present a real-world manufacturing setting that consists of many features, each of which adds complexity to the underlying scheduling problem. The problem is composed of identical jobs. A partially ordered set of operations must be applied to each job. Each operation requires a resource, in the form of a laboratory in which the dedicated machine resides. Each operation is processed by an employee, chosen from a subset of employees eligible to perform this operation. Additional features include set-up times between laboratories, capacity-restricted queues before/after an operation, varying processing times of the different employees, and a requirement to re-process an operation due to stochastic manufacturing failures. The problem is related to several existing NP-hard scheduling problems – reentrant flow shop scheduling, flexible shop scheduling, and cyclic shop scheduling.

החברה המארגנת: ארטרא בע"מ, רחוב יגאל אלון 94 תל אביב 6109202 טלפון: 03-6384444, פקס: 6384455–03 מייל לשאלות

Powered by Eventact EMS