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

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

John W. Fowler, Rene Schabacker, Lars Mönch, 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

schedulinggenetic algorithmsshifting bottleneck heuristiccomplex job shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (16)

Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ A hybrid heuristic to solve the parallel machines job-shop scheduling problem ⋮ Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ Integrating preventive maintenance planning and production scheduling under reentrant job shop ⋮ 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 ⋮ Rule-based scheduling in wafer fabrication with due date-based objectives ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ New multi-objective method to solve reentrant hybrid flow shop scheduling problem

Uses Software

• GALib
• Genocop

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops