An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective

DOI10.1016/J.EJOR.2011.10.020MaRDI QIDQ439458zbMATH OpenOpenAlexFDO

Authors R. Braune, G. Zäpfel, Michael Affenzeller

Publication date 16 August 2012

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2011.10.020

zbMATH Keywords

schedulingsingle machinebranch and boundbottleneck decompositionsubproblem solution

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
• scientific article; zbMATH DE number 1271322
• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 1271322 (Why is no real title available?)
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• A large step random walk for minimizing total weighted tardiness in a job shop
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• A procedure for the one-machine sequencing problem with dependent jobs
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Decomposition methods for large job shops
• Dominance rules in combinatorial optimization problems
• Dominance-based heuristics for one-machine total cost scheduling problems
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Minimizing total weighted tardiness in a generalized job shop
• Multiple-machine lower bounds for shop-scheduling problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemption in single machine earliness/tardiness scheduling
• Scheduling a single machine to minimize a regular objective function under setup constraints
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The one-machine sequencing problem

Cited in

(4)

• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
• A meta-heuristic to solve the just-in-time job-shop scheduling problem
• An enhanced branch-and-bound algorithm for the talent scheduling problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective

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