Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm

2018 ◽  
pp. 455-472
Author(s):  
Yuwei Sun ◽  
Xiaofei Qian ◽  
Siwen Liu
Keyword(s):  
Parallel Machines ◽  
Deteriorating Jobs

scholarly journals Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

2012 ◽  
Vol 2012 ◽  
pp. 1-20 ◽  
Author(s):  
Wenming Cheng ◽  
Peng Guo ◽  
Zeqiang Zhang ◽  
Ming Zeng ◽  
Jian Liang
Keyword(s):  
Variable Neighborhood Search ◽  
Parallel Machines ◽  
Programming Model ◽  
Search Algorithm ◽  
Optimal Schedule ◽  
Deteriorating Jobs ◽  
Mixed Integer ◽  
Computational Time ◽  
Neighborhood Search ◽  
Scheduling Problem

In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

scholarly journals Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs

2010 ◽  
Vol 34 (6) ◽  
pp. 1498-1510 ◽  
Author(s):  
Mohammad Mahdavi Mazdeh ◽  
Farzad Zaerpour ◽  
Abalfazl Zareei ◽  
Ali Hajinezhad
Keyword(s):  
Parallel Machines ◽  
Deteriorating Jobs ◽  
Parallel Machines Scheduling ◽  
Job Tardiness

SCHEDULING POSITION-BASED DETERIORATING JOBS WITH MULTIPLE RATE-MODIFYING ACTIVITIES AND PAST-SEQUENCE-DEPENDENT DELIVERY TIMES

2014 ◽  
Vol 31 (03) ◽  
pp. 1450018 ◽  
Author(s):  
KE CHEN ◽  
MIN JI ◽  
JIAOJIAO GE ◽  
GUIYI WEI
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Parallel Machines ◽  
Deteriorating Jobs ◽  
Planning Horizon ◽  
Parallel Machine ◽  
Total Completion Time ◽  
Delivery Time ◽  
Delivery Times ◽  
Sequence Dependent

In this paper, we consider a scheduling problem with position-based deteriorating jobs and past-sequence-dependent delivery times on a single machine or parallel machines. Each job's delivery time is dependent on its waiting time for processing. Because of the deteriorating effect, each machine will undergo multiple rate-modifying activities throughout the planning horizon to restore its processing rate. For the single-machine case, the objectives are to minimize the makespan and the total completion time. For the parallel-machine case, the objectives are to minimize the total completion time and the total machine load. We show that all these problems are solvable in polynomial time.

Penjadwalan Mesin dengan Metode Integer Linear Programming pada PT. XYZ

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Fransiskus Lauson Matondang ◽  
Rosnani Ginting
Keyword(s):  
Integer Programming ◽  
Time Delays ◽  
Parallel Machines ◽  
Research Concept ◽  
Total Settlement ◽  
Approach Method ◽  
Additional Costs ◽  
Maximum Completion Time ◽  
Completion Times ◽  
Better Than

PT XYZ sering mengalami keterlambatan waktu karena dalam setiap keterlambatan yang dilakukan selalu ada penalty yang diberikan kepada perusahaan dan hal ini mengakibatkan tambahan biaya , oleh karena itu hal ini harus dihindari dengan membuat penjadwalan yang efisien, dalam hal ini dilakukanlah perbaikan dengan meminimisasi waktu penyelesaian maksimum Cmax pada mesin paralel yang berpola aliran flowshop (dan tidak boleh dilakukan interupsi yang dilakukan pada pekerjaan yang sedang diproses, untuk melakukan pekerjaan lainnya, satu lintasan hanya memproduksi satu produk dan hanya satu produk juga yang dikerjakan secara langsung. Waktu penyelesaian yang berbeda dari setiap mesin dengan pengerjaannya juga adalah masalah yang dihadapi untuk menjadikan mesin mesin ini sesuai menjadi satu penjadwalan yang terintegrasi dengan metode integer programming yang membuat penjadwalan dengan konsep riset operasi dengan metode pendekatan 0-1 utuk menjadi lebih efisien lagi , dihasilkan minimisasi keterlambatan total penyelesaian order dengan 42,28 menit lebih baik dari sebelumnya.   PT XYZ often experiences time delays because in every delay made there is always a penalty given to the company and this results in additional costs, therefore this must be avoided by making efficient scheduling, in this case repairs are carried out by minimizing the maximum completion time of Cmax on parallel machines that are patterned with flowshop flow (and no interruptions should be carried out on the work being processed, to do other work, one track only produces one product and only one product is directly worked. Different completion times of each machine with the workmanship is also the problem faced to make this machine suitable to be one scheduling integrated with integer programming methods that makes scheduling with the operational research concept with the 0-1 approach method to be more efficient, resulting in minimization of the delay in the total settlement of orders with 42.28 minutes was better than before.

Sign in / Sign up

Export Citation Format

Share Document