Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops

DOI10.1016/j.ejor.2005.12.020zbMath1109.90044MaRDI QIDQ857354

Lars Mönch, John W. Fowler, Rene Schabacker, Detlef Pabst

Publication date: 14 December 2006

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

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

zbMATH Keywords

scheduling; genetic algorithms; shifting bottleneck heuristic; complex job shops

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Multiple-objective scheduling and real-time dispatching for the semiconductor manufacturing system, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, New multi-objective method to solve reentrant hybrid flow shop scheduling problem, A hybrid heuristic to solve the parallel machines job-shop scheduling problem

Uses Software

• GALib
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Scheduling with batching: A review
• A computational study of shifting bottleneck procedures for shop scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Measures of subproblem criticality in decomposition algorithms for shop scheduling