Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
From MaRDI portal
Publication:1278196
DOI10.1016/0377-2217(95)00119-0zbMath0947.90586OpenAlexW2126371318MaRDI QIDQ1278196
Yeong-Dae Kim, Hyeong-Gyu Lim, Moon-Won Park
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00119-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
Optimal versus heuristic scheduling of surface mount technology lines ⋮ Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Heuristics for search sequencing under time-dependent probabilities of existence ⋮ A systematic procedure for setting parameters in simulated annealing algorithms ⋮ An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. ⋮ Minimizing makespan on an \(m\)-machine re-entrant flowshop ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints ⋮ Optimal algorithm for minimizing production cycle time of a printed circuit board assembly line ⋮ A genetic algorithm of determining cycle time for printed circuit board assembly lines
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
- The two-machine sequence dependent flowshop scheduling problem
- The two-machine flowshop scheduling problem with total tardiness
- A new heuristic method for the flow shop sequencing problem
- Minimizing total tardiness in permutation flowshops
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- A fast tabu search algorithm for the permutation flow-shop problem
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- Unrelated parallel machine scheduling using local search
- Applying tabu search with influential diversification to multiprocessor scheduling
- A decomposition algorithm for the single machine total tardiness problem
- A new heuristic for the n-job, M-machine flow-shop problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Structural Properties of Lot Streaming in a Flow Shop
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- A survey and evaluation of static flowshop scheduling heuristics
- Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- Focused Scheduling in Proportionate Flowshops
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Job Shop Scheduling by Simulated Annealing
- Two- and three-machine flow shop scheduling problems with equal sized transfer batches
- A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
- Tabu Search—Part I
- Tabu Search—Part II
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Simulated Annealing with a Temperature Dependent Penalty Function
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- Bandwidth Packing: A Tabu Search Approach
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
This page was built for publication: Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
