A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
From MaRDI portal
Publication:747040
DOI10.3934/JIMO.2016.12.703zbMath1326.90029OpenAlexW2552583865MaRDI QIDQ747040
Publication date: 22 October 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.703
Programming involving graphs or networks (90C35) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints ⋮ Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties ⋮ A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
Cites Work
- Unnamed Item
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Minimizing total weighted tardiness in a generalized job shop
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- The job shop tardiness problem: A decomposition approach
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- A large step random walk for minimizing total weighted tardiness in a job shop
- An advanced tabu search algorithm for the job shop problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
This page was built for publication: A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
