Simulated Annealing with a Time-Slot Heuristic for Ready-Mix Concrete Delivery

Course scheduling an assignment of courses and lecturers in the available time slots involving certain restrictions. Simulated annealing is a heuristic method can be used as search method and provide acceptable solutions with good results. The research aims to make scheduling courses at the college using simulated annealing using five variables data that lecturer courses, the time slot is comprised of the day and the time period and class room. The research has two objective functions to be generated, the first is the assignment of a lecturer on courses that will be of teaching, second lecturers and their assignment course on the time slot and the room available. The objective function is calculated by taking into account the restrictions involved to produce the optimal solution. The validation is performed by testing to simulated annealing method with an varian average of 77.791% of the data variance can reach a solution with a standard deviation of 3.931509. In this research given the method of solution in the use of the remaining search space to be reused by the data that is unallocated.

Download Full-text

Modeling and Optimization of Inserting Order Schedule of Agile Supply Chain

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.230-232.910 ◽

2011 ◽

Vol 230-232 ◽

pp. 910-915

Author(s):

Xian Feng Huang ◽

Bo Wu ◽

Jian Hua Wang

Keyword(s):

Supply Chain ◽

Simulated Annealing ◽

Simulated Annealing Algorithm ◽

Time Slot ◽

Scheduling Problem ◽

Order Scheduling ◽

Two Stage ◽

Agile Supply Chain ◽

Annealing Algorithm ◽

Production Plans

In order to solve the inserting order scheduling problem of agile supply chains which already have fixed production plans, a two stage supply chain which consists of one factory and many suppliers is studied. Take minimizing the total supply chain cost as the objective, an Integer Planning (IP) model is designed to describe the scheduling problem based on the time slot representation of corps’s available schedule periods, and a Neighbor Value Partial Interchange Simulated Annealing algorithm(NVPI-SA) is proposed to optimize the IP model. Finally, the practicality and effectiveness of the model and algorithm is verified by scheduling experiments.

Download Full-text

SIMULATED ANNEALING APPROACH FOR UNIVERSITY TIMETABLE PROBLEM

Jurnal Ilmiah Matrik ◽

10.33557/jurnalmatrik.v21i3.723 ◽

2019 ◽

Vol 21 (3) ◽

pp. 204-213

Author(s):

R. Kristoforus J. Bendi ◽

Hadi Junaidi

Keyword(s):

Simulated Annealing ◽

Initial Temperature ◽

Time Slot ◽

Scheduling Problems ◽

Use Of Resources ◽

The Common ◽

Common Problems ◽

Timetable Problem ◽

Made In

Abstract : University Scheduling is a way of allocating students, lecturers, and rooms, which is used for lectures in the available time slots. The common problems are that a lecturer is scheduled in the same time slot, or several courses are scheduled in the same room and the same time slot. For this reason, scheduling needs to be made in such a way that it can optimize the use of resources. We use simulated annealing as an approach to solve that problem. The results showed that the higher the initial temperature value used and the greater the iteration value would reduce the violation constraints in scheduling problems.

Download Full-text

Penjadwalan Produksi Menggunakan Metode Simulated Annealing pada Unit Produksi Daun Pintu di PT. ML

Talenta Conference Series Energy and Engineering (EE) ◽

10.32734/ee.v2i2.445 ◽

2019 ◽

Vol 2 (2) ◽

Author(s):

Rosnani Ginting ◽

Chairul Rahmadsyah Manik

Keyword(s):

Simulated Annealing ◽

Problem Solving ◽

Production Scheduling ◽

Production Control ◽

Delivery Time ◽

Production Schedule ◽

A Company ◽

Predetermined Time ◽

Factory Floor

Penjadwalan merupakan aspek yang sangat penting karena didalamnya terdapat elemen perencanaan dan pengendalian produksi bagi suatu perusahaan yang dapat mengirim barang sesuai dengan waktu yang telah ditentukan, untuk memperoleh waktu total penyelesaian yang minimum. Masalah utama yang dihadapi oleh PT. ML adalah keterlambatan penyelesaian order yang mempengaruhi delivery time ke tangan costumer karena pelaksanaan penjadwalan produksi dilantai pabrik belum menghasilkan makespan yang sesuai dengan order yang ada. Oleh kaena itu dituntut untuk mencari solusi pemecahan masalah optimal dalam penentuan jadwal produksi untuk meminimisasi total waktu penyelessaian (makespan) semua order. Dalam penelitian ini, penjadwalan menggunakan metode Simulated Annealing (SA) diharapkan dapat menghasilkan waktu total penyelesaian lebih cepat dari penjadwalan yang ada pada perusahaan. Scheduling is a very important aspect because in it there are elements of planning and production control for a company that can send goods in accordance with a predetermined time, to obtain a minimum total time of completion. The main problem faced by PT. ML is the delay in completing orders that affect delivery time to customer because the implementation of production scheduling on the factory floor has not produced the makespan that matches the existing order. Therefore, it is required to find optimal problem solving solutions in determining the production schedule to minimize the total time of elimination (makespan) of all orders. In this study, scheduling using the Simulated Annealing (SA) method is expected to produce a total time of completion faster than the existing scheduling in the company.

Download Full-text