Scheduling involves the allocation of resources and time to tasks in such a way that certain performance requirements are met. CPU scheduling is the mechanisms of selecting a process among various processes and allocate a processor in such a way so that other processes in a ready queue wait for minimum amount of time. This is usually done by short term scheduler. In a uniprocessor system where only one process may run at a time, any other process must wait until the CPU is free and rescheduled. This article discusses briefly about a more efficient way to scheduling which I termed as ‘JAMM’ scheduling. My experimental result has shown that it reduces the sufficient amount of average waiting time among processes.