Total Tardiness Minimization in Permutation Flow Shops: A Simple Approach Based on a Variable Greedy Algorithm

International Journal of Production Research - United Kingdom
doi 10.1080/00207540701418960
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Informa UK Limited

Related search

Weighted Tardiness Minimization in Job Shops With Setup Times by Hybrid Genetic Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

From Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem With Weighted Tardiness

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Rule Based Heuristic Approach for Minimizing Total Flow Time in Permutation Flow Shop Scheduling

Tehnicki Vjesnik
Engineering
2015English

A Cost-Aware Test Suite Minimization Approach Using TAP Measure and Greedy Search Algorithm

International Journal of Intelligent Engineering and Systems
EngineeringComputer Science
2017English

A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2013English

Minimization of Mean Tardiness in a Flexible Job Shop

International Journal of Simulation Modelling
ModelingComputer Science ApplicationsSimulation
2013English

A Variable Neighborhood Search for the Single Machine Total Stepwise Tardiness Problem

2010English

VNR Algorithm: A Greedy Approach for Virtual Networks Reconfigurations

2011English

Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problem

IFAC Proceedings Volumes
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy