A heuristic algorithm for mean flowtime objective in flowshop scheduling
From MaRDI portal
Publication:1389189
DOI10.1016/S0305-0548(97)00050-6zbMath0904.90090MaRDI QIDQ1389189
Publication date: 11 June 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items
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 ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ 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 ⋮ Heuristics for search sequencing under time-dependent probabilities of existence ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ Concurrent flowshop scheduling to minimize makespan. ⋮ A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP ⋮ 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 new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ Two-machine flowshop scheduling with job class setups to minimize total flowtime ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates ⋮ An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems ⋮ 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 multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
Cites Work
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- Some efficient heuristic methods for the flow shop sequencing problem
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A new heuristic for the n-job, M-machine flow-shop problem
- Optimal two- and three-stage production schedules with setup times included
- 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
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Unnamed Item
