An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

DOI10.1016/S0377-2217(96)00273-1zbMath0922.90089MaRDI QIDQ1280126

Hans Ziegler, Chandrasekharan Rajendran

Publication date: 10 March 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

lower boundsheuristicflowshoptotal weighted flowtime of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (33)

Several flow shop scheduling problems with truncated position-based learning effect ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects ⋮ Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. ⋮ Heuristic for no-wait flow shops with makespan minimization ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ A note on the total completion time problem in a permutation flowshop with a learning effect ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Comparison of heuristics for flowtime minimisation in permutation flowshops ⋮ A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs ⋮ A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ Heuristic dispatching rule to maximize TDD and IDD performance ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Scheduling in cellular manufacturing systems: an heuristic approach ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization ⋮ A genetic algorithm for scheduling open shops with sequence-dependent setup times ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• Modified simulated annealing algorithms for the flow shop sequencing problem
• Flowshop sequencing with mean flowtime objective
• A user's guide to tabu search
• Optimal two- and three-stage production schedules with setup times included
• ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
• An Evaluation of Flow Shop Sequencing Heuristics
• AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
• The Complexity of Flowshop and Jobshop Scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs