A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD

Cites Work

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
A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
A tabu search algorithm for parallel machine total tardiness problem
Bottleneck-focused scheduling for a hybrid flowshop
Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
Hybrid flow-shop scheduling problems with multiprocessor task systems.
A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
Developing scheduling systems for Daewoo shipbuilding: DAS project
Availability of a 2-Component Dependent 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)