A tabu search algorithm for a pipe-processing flowshop scheduling problem minimizing total tardiness in a shipyard
From MaRDI portal
Publication:3406729
Recommendations
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Scheduling in flowshops to minimize total tardiness of jobs
- scientific article; zbMATH DE number 1488079
- A tabu search approach for the flow shop scheduling problem
Cites work
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A tabu search algorithm for parallel machine total tardiness problem
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Availability of a 2-Component Dependent System
- Bottleneck-focused scheduling for a hybrid flowshop
- Developing scheduling systems for Daewoo shipbuilding: DAS project
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Sequencing of jobs in some production system
This page was built for publication: A tabu search algorithm for a pipe-processing flowshop scheduling problem minimizing total tardiness in a shipyard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3406729)
