This research work considers a scenario of cloud computing job-shop scheduling problems. We consider m realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met. and the profit of processing a packet of a job differs from other jobs. https://www.bekindtopets.com/limited-stock-Bovi-Shield-Gold-FP-5-L5-HB-best-super/