Job-shop scheduling: Computational study of local search and large-step optimization methods
From MaRDI portal
Publication:1388829
DOI10.1016/0377-2217(95)00012-FzbMath0904.90089MaRDI QIDQ1388829
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
heuristicssimulated annealingtraveling salesmanlocal optimizationjob-shop schedulingcomputational analysislarge-step optimization
Related Items (23)
A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints ⋮ A hybrid evolutionary algorithm to solve the job shop scheduling problem ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search ⋮ Metaheuristics: A bibliography ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Scheduling jobs with normally distributed processing times on parallel machines ⋮ A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ A hybrid genetic algorithm for the job shop scheduling problem ⋮ An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem ⋮ Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem ⋮ Local search heuristics for two-stage flow shop problems with secondary criterion ⋮ Parallel Algorithm Portfolio with Market Trading-Based Time Allocation ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Heuristics for minimizing total weighted tardiness in flexible flow shops ⋮ Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing ⋮ A large step random walk for minimizing total weighted tardiness in a job shop ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- The one-machine sequencing problem
- Large-step Markov chains for the TSP incorporating local search heuristics
- A branch and bound algorithm for the job-shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Equation of State Calculations by Fast Computing Machines
This page was built for publication: Job-shop scheduling: Computational study of local search and large-step optimization methods
