A survey of scheduling with parallel batch (p-batch) processing
From MaRDI portal
Publication:2076906
Recommendations
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- No-wait scheduling problems with batching machines
- Parallel batching with multi-size jobs and incompatible job families
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Batching identical jobs
Cites work
- A batch-oblivious approach for complex job-shop scheduling problems
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A brief history of linear and mixed-integer programming computation
- A constraint programming approach for a batch processing problem with non-identical job sizes
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- A General Class of Bulk Queues with Poisson Input
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
- A Multiserver Queue with Thresholds for the Acceptance of Customers into Service
- A Primer in Column Generation
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Ant colony optimization.
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
- Approximations for Product Departures from a Single-Server Station with Batch Processing in Multi-Product Queues
- Arc-flow approach for single batch-processing machine scheduling
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- Bi-objective scheduling on a restricted batching machine
- Bicriterion scheduling with equal processing times on a batch processing machine
- Bounded parallel-batching scheduling with two competing agents
- Branch-and-price: Column generation for solving huge integer programs
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Control of a batch-processing machine: A computational approach
- Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
- CP and hybrid models for two-stage batching and scheduling
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance
- Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Dynamic scheduling on a single batch processing machine with split compatibility graphs
- Earliness and tardiness scheduling problems on a batch processor
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Heuristic scheduling of jobs on a multi-product batch processing machine
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- Heuristics for minimizing total weighted tardiness in complex job shops
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 5017341 (Why is no real title available?)
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- scientific article; zbMATH DE number 558543 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1859343 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- scientific article; zbMATH DE number 3088542 (Why is no real title available?)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- Improved MILP models for two-machine flowshop with batch processing machines
- Integrated scheduling on parallel batch processing machines with non-identical capacities
- Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study
- Learning effective dispatching rules for batch processor scheduling
- Makespan minimization in a no-wait flow shop problem with two batching machines
- Makespan minimization on single batch-processing machine via ant colony optimization
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Minimizing due date related performance measures on two batch processing machines
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing total completion time on a batch processing machine with job families
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Mixed batch scheduling on identical machines
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Multiagent scheduling. Models and algorithms
- Multilevel Bulk Service Queues
- Multiobjective scheduling of jobs with incompatible families on parallel batch machines
- No-wait scheduling problems with batching machines
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Online over time scheduling on parallel-batch machines: a survey
- Optimal batching in a wafer fabrication facility using a multiproduct G/G/c model with batch processing
- Optimal control of batch service queues
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Optimization by simulated annealing
- Principles of Constraint Programming
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Rescheduling strategies for minimizing total weighted tardiness in complex job shops
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling a batching machine
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Scheduling job shops with batch machines using the Lagrangian relaxation technique
- Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Scheduling on a batch machine with job compatibilities
- Scheduling one batch processor subject to job release dates
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Scheduling with agreeable release times and due dates on a batch processing machine
- Scheduling with batching: A review
- Scheduling. Theory, algorithms, and systems
- Single- and multiple-processor models for minimizing completion time variance
- Solving single batch-processing machine problems using an iterated heuristic
- Some simple scheduling algorithms
- Steady state results for the M/M(a,b)/c batch-service system
- Stochastic scheduling of a batch processing machine with incompatible job families
- Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
- Taxonomy of batch queueing models in manufacturing systems
- The Batch Loading and Scheduling Problem
- The Price of Robustness
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The use of upstream and downstream information in scheduling semiconductor batch operations
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Two-Server Bulk-Service Queuing Process
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Variable neighborhood search: Principles and applications
Cited in
(56)- Scheduling with batching: A review
- Online scheduling of two-machine flowshop with lookahead and incompatible job families
- A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
- Research on the parallel-batch scheduling with linearly lookahead model
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- No-wait scheduling problems with batching machines
- PSBS: Practical Size-Based Scheduling
- A scheduling model of parallel batch process based on pre-ordering
- Exact approaches for single machine total weighted tardiness batch scheduling
- Exact methods for the oven scheduling problem
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches
- Literature reviews in operations research: a new taxonomy and a meta review
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- Parallel batching with multi-size jobs and incompatible job families
- Improved analysis of two algorithms for min-weighted sum bin packing
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
- Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines
- Serial batching to minimize the weighted number of tardy jobs
- Logic-based Benders decomposition for additive manufacturing scheduling on unrelated parallel machines
- Approximation algorithms for parallel batch machine scheduling of malleable jobs
- Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities
- A new class of lower bounds for scheduling a batch processing machine to minimize makespan
- Multiple parallel-batch machines scheduling with additive resource assignment and machine available times
- Fifty years of research in scheduling -- theory and applications
- Online scheduling on a parallel-batch machine with pulse interruptions
- On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups
- Non-resumable scheduling on a single bounded parallel-batch machine with flexible maintenance
- The coordination mechanism for scheduling game with deterioration jobs and uniform-batch machines
- Instance space analysis and algorithm selection for a parallel batch scheduling problem
- Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties
- Multi-neighborhood simulated annealing for the oven scheduling problem
- Batch processing machine scheduling problems using a self-adaptive approach based on dynamic programming
- Towards sustainable scheduling of unrelated parallel batch processors: a multiobjective approach with triple bottom line, classical and data-driven robust optimization
- Novel mathematical formulations for parallel-batching processing machine scheduling problems
- Revisiting the development trajectory of parallel machine scheduling
- Non-identical parallel machines batch processing problem to minimize the makespan: models and algorithms
- One-dimensional bin packing with pattern-dependent processing time
- A new branch-and-cut approach for integrated planning in additive manufacturing
- Bounded mixed batch scheduling with job release dates and rejection
- Mixed batch scheduling with non-identical job sizes to minimize makespan
- Submodular batch scheduling on parallel machines
- Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing
- Optimizing parallel batch scheduling on uniform machines: a focus on equal job durations with varied release dates and sizes
- An improved genetic algorithm based on game theory for multi-objective flexible job shop scheduling problem with batch processing machines
- Optimizing hospital sterilization operations: a column generation approach for parallel batch scheduling with job families
This page was built for publication: A survey of scheduling with parallel batch (p-batch) processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076906)
