Consider a job scheduling problem with 4 jobs J1, J2, J3, J4 and with corresponding deadlines: ( d1, d2, d3, d4) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?Group of answer choicesJ4, J2, J1, J3J2, J4, J1, J3J4, J2, J3, J1J4, J1, J2, J3

Which of the following is not a type of scheduling problem? ans. Single Machine Flow Shop Job-Shop Young Shop

Jobs with high ______ allow workers to set their own schedules and decide how to perform the necessary tasks.Multiple choice question.task identityskill varietyfeedbackautonomy

A company is scheduling four workshops (W1, W2, W3, W4). The following conditions apply:W1 must be scheduled before W2.W3 must be scheduled before W4.W4 must be scheduled after W2.Question:Which workshop must be scheduled first?Options:A) W1B) W2C) W3D) W4

A supervisor needs to assign five tasks (T1, T2, T3, T4, T5) to three employees (E1, E2, E3) based on the following conditions:E1 must be assigned T1 or T2.E3 cannot be assigned T3.T4 must be done before T5.E2 can only be assigned T3 or T5.Question:Which task must E1 be assigned to?Options:A) T1B) T2C) T3D) T4

In a Restricted assignment problem_____________a.A specific job cannot be performed on a particular machineb.Single job cannot be assigned to every single machine to obtain the optimal solutionc.A specific job can be performed on a particular machined.None of the above