Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

DOI10.1016/j.cor.2004.04.001zbMath1071.90019MaRDI QIDQ1781549

Lars Mönch, John W. Fowler, Hari Balasubramanian, Michele E. Pfund

Publication date: 27 June 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.001

zbMATH Keywords

Genetic algorithms; Scheduling; Batching; Parallel machines; Semiconductor manufacturing

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times, Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes, Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling, A novel approach to hedge and compensate the critical dimension variation of the developed-and-etched circuit patterns for yield enhancement in semiconductor manufacturing, Bicriteria scheduling problem for unrelated parallel machines with release dates, Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates, Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems, Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes, Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, Minimizing makespan for multi-spindle head machines with a mobile table, A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival, Rule-based scheduling in wafer fabrication with due date-based objectives, Online scheduling of incompatible unit-length job families with lookahead, An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan

Uses Software

• GALib
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
• Stochastic scheduling of a batch processing machine with incompatible job families
• A new dynamic look-ahead scheduling procedure for batching machines
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The use of upstream and downstream information in scheduling semiconductor batch operations
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure