DMSS: A Dynamic Memory Scheduling System in Server Consolidation Environments

Students and scheduling are both essential parts in a higher educational institution. However, after schedules are arranged and students has agreed to them, there are some occasions that can occur beyond the control of the university or lecturer which require the courses to be cancelled and arranged for replacement course schedules. At Universitas Multimedia Nusantara, an agreement between lecturers and students manually every time to establish a replacement course. The agreement consists of a replacement date and time that will be registered to the division of BAAK UMN which then enter the new schedule to the system. In this study, Ant Colony Optimization algorithm is implemented for scheduling replacement courses to make it easier and less time consuming. The Ant Colony Optimization (ACO) algorithm is chosen because it is proven to be effective when implemented to many scheduling problems. Result shows that ACO could enhance the scheduling system in Universitas Multimedia Nusantara, which specifically tested on the Department of Informatics replacement course scheduling system. Furthermore, the newly built system has also been tested by several lecturers of Informatics UMN with a good level of perceived usefulness and perceived ease of use. Keywords—scheduling system, replacement course, Universitas Multimedia Nusantara, Ant Colony Optimization

Download Full-text

Flexible Production Scheduling System (The National Shipbuilding Research Program)

10.21236/ada445649 ◽

1986 ◽

Author(s):

TODD PACIFIC SHIPYARDS CORP SEATTLE WA

Keyword(s):

Research Program ◽

Production Scheduling ◽

Flexible Production ◽

Scheduling System

Download Full-text

How to write a class

10.1093/oso/9780198708636.003.0006 ◽

2018 ◽

Author(s):

Joseph F. Boudreau ◽

Eric S. Swanson

Keyword(s):

Computer Science ◽

Software Design ◽

Memory Allocation ◽

Quantum Mechanical ◽

Sufficient Information ◽

Trial And Error ◽

Dynamic Memory ◽

Dynamic Memory Allocation

While there is no such thing as a “typical” C++ class, several common syntactical constructs lend themselves to extremely widespread use and must be mastered by C++ programmers. To motivate the discussion of software design at the level of the C++ class, examples from computer science and optics are introduced. Important syntactical elements such as constructors, destructors, copy constructors, assignment operators, cast operators, and const qualifiers, together with function overloading, operator overloading, and dynamic memory allocation are discussed. These concepts, illustrated with examples from physics, are presented and explained. Further examples from optical and quantum mechanical problems are left to the exercises. This chapter and its exercises gives the reader sufficient information to begin developing his or her own classes and to experiment with class design through trial and error.

Download Full-text