A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
From MaRDI portal
Publication:1607977
DOI10.1002/JOS.102zbMATH Open1009.90045OpenAlexW1991547818MaRDI QIDQ1607977FDOQ1607977
Scott J. Mason, John Fowler, W. Matthew Carlyle
Publication date: 8 August 2002
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.102
Recommendations
- Heuristics for minimizing total weighted tardiness in complex job shops
- scientific article; zbMATH DE number 1271322
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- scientific article; zbMATH DE number 1859343
Cites Work
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Title not available (Why is that?)
- A modified shifting bottleneck procedure for job-shop scheduling
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Extending the shifting bottleneck procedure to real-life applications
- Title not available (Why is that?)
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
Cited In (31)
- A New Bottleneck-Based Heuristic for Reentrant Job Shops: A Case Study in a Textile Factory
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
- Column generation heuristics for multiple machine, multiple orders per job scheduling problems
- Multiple orders per job batch scheduling with incompatible jobs
- Heuristics for minimizing total weighted tardiness in complex job shops
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
- 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
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- A dynamic WIP control strategy for bottlenecks in a wafer fabrication system
- A survey of scheduling problems with setup times or costs
- Scheduling algorithms for a semiconductor probing facility
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- A linear programming-based method for job shop scheduling
- An improved shifting bottleneck procedure for the job shop scheduling problem
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
- Capacity requirements planning for twin fabs of wafer fabrication
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- A survey of scheduling with parallel batch (p-batch) processing
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming
This page was built for publication: A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607977)
