Priority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling problem
We propose an efficient heuristic method for job-shop scheduling problems (JSP) with the objective of total weighted tardiness minimization. The proposed method uses schedule reconstructions by priority rules to guide a local search towards promising solutions. Typically priority rules determine the...
Main Authors: | Soichiro YOKOYAMA, Hiroyuki IIZUKA, Masahito YAMAMOTO |
---|---|
Format: | Article |
Language: | English |
Published: |
The Japan Society of Mechanical Engineers
2014-10-01
|
Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
Subjects: | |
Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/8/5/8_2014jamdsm0073/_pdf/-char/en |
Similar Items
-
Job shop scheduling for meeting due dates and minimizing overtime using genetic algorithm incorporating new priority rules
by: Mitsunobu YODA, et al.
Published: (2014-10-01) -
Scheduling algorithm with controllable train speeds and departure times to decrease the total train tardiness
by: Omid Gholami, et al.
Published: (2014-04-01) -
Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
by: Xiaoping Li, et al.
Published: (2015-12-01) -
An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
by: Dana Marsetiya Utama, et al.
Published: (2020-03-01) -
Analysis of dispatching rules application on scheduling problem in flexible-flow shop production
by: Rakićević Zoran M., et al.
Published: (2014-01-01)