A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
From MaRDI portal
Publication:1607977
DOI10.1002/jos.102zbMath1009.90045OpenAlexW1991547818MaRDI QIDQ1607977
Scott J. Mason, John W. 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
Related Items
A dynamic WIP control strategy for bottlenecks in a wafer fabrication system, Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance, A multi-criteria approach for scheduling semiconductor wafer fabrication facilities, 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, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops, 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, A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication, 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, 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, A general approach for optimizing regular criteria in the job-shop scheduling problem, A linear programming-based method for job shop scheduling, An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective, A branch and bound method for the job-shop problem with sequence-dependent setup times, Multiple orders per job batch scheduling with incompatible jobs, Column generation heuristics for multiple machine, multiple orders per job scheduling problems, A survey of scheduling problems with setup times or costs, Heuristics 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, Capacity requirements planning for twin Fabs of wafer fabrication, Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times, Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines, A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Unnamed Item
- Unnamed Item
- Extending the shifting bottleneck procedure to real-life applications
- Scheduling jobs on parallel machines with sequence-dependent setup times
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- 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
- A modified shifting bottleneck procedure for job-shop scheduling
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
