Tabu search for Jumping No-Wait Flowshop scheduling problem to minimize makespan
碩士 === 國立交通大學 === 工業工程與管理學系 === 101 === Our study investigates the scheduling problem for the environment of Jumping No-Wait flowshop (JNWF), where jobs are not allowed to wait for machines during the production processes. In the production processes, all jobs are ordered visit a sequence of m mach...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65674159276119020862 |
| Summary: | 碩士 === 國立交通大學 === 工業工程與管理學系 === 101 === Our study investigates the scheduling problem for the environment of Jumping No-Wait flowshop (JNWF), where jobs are not allowed to wait for machines during the production processes. In the production processes, all jobs are ordered visit a sequence of m machines and some jobs skip some machines in the sequence, which is called "machine jumping". The problem is to determine the sequence of jobs being released for the first machine and our objective is to minimize the makespan. In this paper, we study the characteristics of JNWF scheduling problem and propose a Probability Enhanced Tabu Search (PETS) based on improved Tabu search method. We then compare our heuristic with Radran’s heuristic (1994), on the makespan and the computational time. The numerical studies show that our heuristic performs more effectively and efficiently than Radran’s heuristic on solving the JNWF problems.
|
|---|