A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm (Q411034): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Rui Zhang / rank | |||
Property / author | |||
Property / author: Rui Zhang / rank | |||
Normal rank | |||
Property / review text | |||
Summary: 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. | |||
Property / review text: Summary: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6021720 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/623230 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995918244 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58906256 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4124328 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An advanced tabu search algorithm for the job shop problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ant colony optimisation with parameterised search space for the job shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4238569 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A large step random walk for minimizing total weighted tardiness in a job shop / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing total weighted tardiness in a generalized job shop / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improving job shop performance by coordinating dispatching rules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new dispatching rule based genetic algorithm for the multi-objective job shop problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic job-shop scheduling: Past, present and future / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning Bayesian networks: The combination of knowledge and statistical data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey of optimization by building and using probabilistic models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Towards a new evolutionary computation. Advances on estimation of distribution algorithms. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:53, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm |
scientific article |
Statements
A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm (English)
0 references
4 April 2012
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references