A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD
From MaRDI portal
Publication:3406729
DOI10.1142/S0217595909002493zbMath1180.90122MaRDI QIDQ3406729
Ye Jin, Jinsong Bao, Xiao-Feng Hu
Publication date: 19 February 2010
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Developing scheduling systems for Daewoo shipbuilding: DAS project
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Sequencing of jobs in some production system
- A tabu search algorithm for parallel machine total tardiness problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Availability of a 2-Component Dependent System
- Bottleneck-focused scheduling for a hybrid flowshop
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
This page was built for publication: A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD