An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
From MaRDI portal
Publication:1280126
DOI10.1016/S0377-2217(96)00273-1zbMath0922.90089MaRDI QIDQ1280126
Chandrasekharan Rajendran, Hans Ziegler
Publication date: 10 March 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Heuristic dispatching rule to maximize TDD and IDD performance, Heuristic for no-wait flow shops with makespan minimization, Scheduling in cellular manufacturing systems: an heuristic approach, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A note on the total completion time problem in a permutation flowshop with a learning effect, A bicriteria flowshop scheduling with a learning effect, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, 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, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs., A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime, Comparison of heuristics for flowtime minimisation in permutation flowshops
Uses Software
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
