SCHEDULING EXAMPLE-1: Assignment Method of Linear Programming for Loading) Southern Cans (SC) packages processed foods into cans for a variety of customers. The factory has four multipurpose cookers and canning lines that can pressure-cook, vacuum-pack, and applies labels to just about any type of food or size of can. The processing equipment pieces were purchased some years apart, and some of the cookers are faster and more efficient than others. SC has four orders that need to be run today for a particular customer: canned beans, canned peaches, conned tomatoes, and canned corn. The customer is operating under just-in-time operating system and needs the mixed order of canned food tomorrow. SC has estimated the number of hours required to pressure-cook, process, and can each type of food by type of cooker as follows: Cooker Food Type 1 10 2 5 3 6 4 10 Beans 6 2 4 6 Peaches Tomatoes Corn 7 6 5 6 10 9 5 4 Due to time constraints imposed by lengthy changeover procedures, only one job can be assigned to one cooker. a) How should the jobs be assigned to the cookers in order to process food more efficiently (i.e., in the least amount of time)? b) It costs $100/hour for each machine to operate, what is the minimum cost to process these batches? If the processing must be done by 6pm today to ensure tomorrow's delivery, at what time the processing MUST start? d) Due to energy supply restrictions, ONLY one machine can be operated at a given time. How much operating time is needed to process these orders? c)