Multiple machine JIT scheduling: a tabu search approach
- 26 September 2007
- journal article
- research article
- Published by Informa UK Limited in International Journal of Production Research
- Vol. 45 (21), 4899-4915
- https://doi.org/10.1080/00207540600871228
Abstract
This paper presents an approach to solving the multiple machine, non-preemptive, earliness-tardiness scheduling problem with unequal due dates in a flow shop with machine tiers (FMT). In this variant of the flow shop problem, machines are arranged in tiers or groups, and the jobs must visit one machine in each tier. The processing times, machine assignments, and due dates are deterministic and known in advance. The objective is to find a permutation schedule that minimizes the total deviation of each job from its due date. A tabu search (TS) meta-heuristic combined with an LP evaluation function is applied to solve this problem and results are compared to optimal permutation solutions for small problems and the earliest due date schedule for large problems. Several neighborhood generation methods and two diversification strategies are examined to determine their effect on solution quality. Results show that the TS method works well for this problem. TS found the optimal solution in all but one of the small problem instances and improved the earliest due date solutions for larger instances where no optimal solutions could be found.Keywords
This publication has 31 references indexed in Scilit:
- Optimization of process plans using a constraint-based tabu search approachInternational Journal of Production Research, 2004
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up timesInternational Journal of Production Research, 2000
- Genetic algorithm to production planning and scheduling problems for manufacturing systemsProduction Planning & Control, 2000
- Minimizing the sum of job earliness and tardiness in a multimachine systemInternational Journal of Production Research, 1998
- Tabu search for resource-constrained schedulingEuropean Journal of Operational Research, 1998
- Performance enhancements to tabu search for the early/tardy scheduling problemEuropean Journal of Operational Research, 1998
- A tabu search procedure for periodic job shop schedulingComputers & Industrial Engineering, 1996
- Scheduling a flow-line manufacturing cell: a tabu search approachInternational Journal of Production Research, 1993
- Improving the Efficiency of Tabu Search for Machine Sequencing ProblemsJournal of the Operational Research Society, 1993
- SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCHIIE Transactions, 1993