Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times

DOI10.1016/j.cor.2005.11.014zbMath1185.90179OpenAlexW2027355655MaRDI QIDQ878582

John W. Fowler, Michele E. Pfund, Rajesh Swaminathan, Scott J. Mason, Ahmet Burak Keha

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.014

zbMATH Keywords

manufacturingpermutationheuristicflowshop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (3)

A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing total tardiness in permutation flowshops
• Genetic algorithms. Concepts and designs
• Tabu search for total tardiness minimization in flowshop scheduling problems
• A genetic algorithm for flowshop sequencing
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• A comprehensive review and evaluation of permutation flowshop heuristics
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families
• Benchmarks for basic scheduling problems
• Group technology in a hybrid flowshop environment: a case study
• Optimal two- and three-stage production schedules with setup times included
• The Lessons of Flowshop Scheduling Research
• A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
• Which is better, off-line or real-time scheduling?
• Scheduling in flowshops to minimize total tardiness of jobs
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

This page was built for publication: Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times