A large step random walk for minimizing total weighted tardiness in a job shop

DOI10.1002/(SICI)1099-1425(200005/06)3:3%3C125::AID-JOS40%3E3.0.CO;2-CzbMATH Open0969.90045OpenAlexW2051604785MaRDI QIDQ1579121FDOQ1579121

Authors: Stephan Kreipl 

Publication date: 4 September 2000

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200005/06)3:3%3C125::aid-jos40%3E3.0.co;2-c

Recommendations

• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• scientific article; zbMATH DE number 1271322
• Minimizing total weighted tardiness in a generalized job shop
• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective

zbMATH Keywords

job shoptotal weighted tardinesslarge step radom walk

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A user's guide to tabu search
• Optimization by simulated annealing
• On a routing problem
• Title not available (Why is that?)
• Tabu Search—Part I
• A survey of priority rule-based scheduling
• Applying tabu search to the job-shop scheduling problem
• Job Shop Scheduling by Simulated Annealing
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Title not available (Why is that?)
• Job Shop Scheduling by Local Search
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Global optimization
• Title not available (Why is that?)
• Large-step Markov chains for the TSP incorporating local search heuristics
• A Computational Study of Local Search Algorithms for Job Shop Scheduling

Cited In (23)

• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
• A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
• Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
• Evolutionary Computation in Combinatorial Optimization
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
• A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
• Heuristic approaches for scheduling jobs in large-scale flexible job shops
• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
• A linear programming-based method for job shop scheduling
• Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
• Minimizing total weighted tardiness in a generalized job shop
• The job shop scheduling problem with convex costs
• An iterated local search algorithm for the lot-streaming flow shop scheduling problem

This page was built for publication: A large step random walk for minimizing total weighted tardiness in a job shop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579121)