This article investigates in cloud computing systems about problem of delay optimal Virtual Machine (VM) scheduling holds constant resources with full infrastructure like CPU, memory and storage in the resource pool. Cloud computing offers users with VMs as utilities. Cloud consumers randomly demand different VM types over time, and the usual length of the VM hosting differs greatly. A scheduling algorithm for a multilevel queue divides the prepared queue towards lengthy and various queues. System is allocated with single queue in to several longer queues. The systems are allocated to one queue indefinitely, usually on any basis of process property, like memory size, process priority, or process sort. Every queue will have its self-algorithm for scheduling. Likewise, a system that's taking in a less preference queue is so lengthy, a high-priority queue can be transferred. Using Particle Swarm Optimization Algorithm (MQPSO), Multi-level queue scheduling has been done. To evaluate the solutions, it explores both Shortest-Job-First (SJF) buffering and Min-Min Best Fit (MMBF) programming algorithms, i.e., SJF-MMBF. The scheme incorporating the SJF-ELM-specific scheduling algorithms depending SJF buffering and Extreme Learning Machine (ELM) is also being proposed to prevent work hunger in an SJF-MMBF system. Furthermore, the queues must be planned, which is usually used as a preventive fixed priority schedule. The results of the simulation show that the SJF-ELM is ideal inside strong duty as well as maximum is environment dynamically, with an efficient average employment hosting rate. Keywords: Delay-optimal virtual machine, scheduling algorithm, Shortest-Job-First, Min-Min Best Fit, Multi-level queue scheduling, VM-hosting durations and Particle SwarmOptimization.