Heuristics for minimizing total weighted tardiness in flexible flow shops
From MaRDI portal
Publication:1567299
DOI<89::AID-JOS36>3.0.CO;2-N 10.1002/(SICI)1099-1425(200003/04)3:2<89::AID-JOS36>3.0.CO;2-NzbMath0968.90038MaRDI QIDQ1567299
Ya Yang, Stephan Kreipl, Michael L. Pinedo
Publication date: 5 June 2000
Published in: Journal of Scheduling (Search for Journal in Brave)
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Decomposition methods (49M27)
Related Items
Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Graphical Techniques for Detecting Lines with the Hough Transform ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines ⋮ A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time ⋮ A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
Cites Work
- Unnamed Item
- Unnamed Item
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Large-step Markov chains for the TSP incorporating local search heuristics
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A user's guide to tabu search
- Applying tabu search to the job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
