A dispatching algorithm for flexible job-shop scheduling with transfer batches: an industrial application
Authors:
- 3 May 2013
- journal article
- research article
- Published by Taylor & Francis in Production Planning & Control
- Vol. 25 (2) , 93-109
Abstract
In this study, we present a dispatching algorithm to solve a real-world case of the flexible job-shop scheduling problem with transfer batches and the objective of minimising the average tardiness of production orders. The proposed algorithm considers two variants: (i) an ordered variant, where the priority dispatching rules are applied in a predefined order, and (ii) a randomised variant, where the user can assign probabilities (weights) to the priority rules. Using the information of the number of units and due dates requested by the only customer, the algorithm provides the sequence of operations that must be performed on each machine, as well as the start and completion times of operations. In order to reduce the impact of unexpected events on a generated schedule, several robustness rules are considered. The obtained results substantially improve the former method used in the company in terms of minimising average tardiness. Additionally, other important benefits are obtained, including significant saving in the time spent on scheduling, simplicity of use of the proposed procedure, robustness against unexpected events, reduction of idle times, improvement of decision-making information, and improvement of on-time delivery performance.Keywords
This publication has 36 references indexed in Scilit:
- Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic AlgorithmExpert Systems with Applications, 2012
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing timesComputers & Operations Research, 2012
- A computational study of a shifting bottleneck heuristic for multi-product complex job shopsProduction Planning & Control, 2010
- Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problemsComputers & Industrial Engineering, 2008
- Reducing lead time in the banking industry: an experimental approach to the loan granting processProduction Planning & Control, 2008
- An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problemsComputers & Industrial Engineering, 2005
- Delivery date decision support system for the large scale make-to-order manufacturing companies: A Korean electric motor company caseProduction Planning & Control, 1999
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993
- A survey of priority rule-based schedulingOR Spectrum, 1989