Consider a shop floor in which the production consists of two layers. In the first layer, the jobs which are all available at the beginning of the planning horizon receive a single operation from a single machine. Once a job is completed by the single machine then it is moved to the second layer. This layer involves two identical parallel machines and the objective of the scheduler is to minimize the total time that the jobs remain on the shop floor. It is known that the jobs cannot be interrupted. a) Classify the layers, separately, as a scheduling problem (i.e., give the corresponding triplet definition al Bly). b) Design a solution approach to help the scheduler. Clearly define your approach, step by step.