A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Most existing research on the job shop scheduling problem has been focused on the minimization of makespan (i.e., the completion time of the last job). However, in the fiercely competitive market nowadays, delivery punctuality is more important for maintaining a high service reputation. So in this paper, we aim at solving job shop scheduling problems with the total weighted tardiness objective. Several dispatching rules are adopted in the Giffler-Thompson algorithm for constructing active schedules. It is noticeable that the rule selections for scheduling consecutive operations are not mutually independent but actually interrelated. Under such circumstances, a probabilistic model-building genetic algorithm (PMBGA) is proposed to optimize the sequence of selected rules. First, we use Bayesian networks to model the distribution characteristics of high-quality solutions in the population. Then, the new generation of individuals is produced by sampling the established Bayesian network. Finally, some elitist individuals are further improved by a special local search module based on parameter perturbation. The superiority of the proposed approach is verified by extensive computational experiments and comparisons. Copyright © 2012 Rui Zhang and Cheng Wu.

Cite

CITATION STYLE

APA

Zhang, R., & Wu, C. (2012). A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm. Journal of Applied Mathematics, 2012. https://doi.org/10.1155/2012/623230

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free