1994 | OriginalPaper | Chapter
Open Shop
Authors : V. S. Tanaev, Y. N. Sotskov, V. A. Strusevich
Published in: Scheduling Theory. Multi-Stage Systems
Publisher: Springer Netherlands
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The jobs of a set N = 1, 2,…, n are processed in a system consisting of M sequential machines. A job i ∈ N enters a system at time di > 0. For each job of set N, a route (a processing order) is not given in advance and may be different for different jobs. The processing times tiL ≥ 0 of each job i ∈N on each machine L, 1 ≤ L ≥M, are given. The notation tiL = 0 implies that job i is not processed on machine L. At any time, each job is processed on at most one machine, and each machine processes no more than one job. Such processing systems are called open shops.