A batch-oblivious approach for complex job-shop scheduling problems

DOI10.1016/j.ejor.2017.04.050zbMath1380.90119OpenAlexW2609642187MaRDI QIDQ1695012

Sebastian Knopp, Stéphane Dauzère-Pérès, Claude Yugma

Publication date: 6 February 2018

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

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

zbMATH Keywords

schedulingmetaheuristicsgraspflexible job-shop scheduling with batchingOR in semiconductor manufacturing

Mathematics Subject Classification ID

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

Related Items (9)

Job scheduling of diffusion furnaces in semiconductor fabrication facilities ⋮ A survey of job shop scheduling problem: the types and models ⋮ Optimizing multiple qualifications of products on non-identical parallel machines ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ Parallel machine scheduling with time constraints on machine qualifications ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ A survey of scheduling with parallel batch (p-batch) processing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic approaches for scheduling jobs in large-scale flexible job shops
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• Maintaining longest paths incrementally
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
• A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Greedy randomized adaptive search procedures
• Scheduling with batching: A review
• Effective neighbourhood functions for the flexible job shop problem
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
• Topological sorting of large networks
• A dynamic topological sort algorithm for directed acyclic graphs
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The Complexity of Flowshop and Jobshop Scheduling
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Heuristics for minimizing total weighted tardiness in complex job shops

This page was built for publication: A batch-oblivious approach for complex job-shop scheduling problems