Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem

DOI10.1007/s10951-015-0441-1zbMath1347.90050OpenAlexW1940095486MaRDI QIDQ309064

Torsten Hildebrandt, Yi Tan, Bernd-Scholz Reiter

Publication date: 7 September 2016

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

Full work available at URL: https://doi.org/10.1007/s10951-015-0441-1

zbMATH Keywords

production schedulingjob shopshifting bottlenecktotal weighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

A survey of job shop scheduling problem: the types and models

Uses Software

• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
• A procedure for the one-machine sequencing problem with dependent jobs
• Scheduling jobs on parallel machines with sequence-dependent setup times
• Variable neighborhood search
• A large step random walk for minimizing total weighted tardiness in a job shop
• Decomposition methods for large job shops
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Benchmarks for basic scheduling problems
• Scheduling with due date assignment under special conditions on job processing
• A linear programming-based method for job shop scheduling
• A computational study of shifting bottleneck procedures for shop scheduling problems
• On a routing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Heuristics for minimizing total weighted tardiness in complex job shops
• A modified shifting bottleneck procedure for job-shop scheduling
• Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Scheduling

This page was built for publication: Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem