A survey of scheduling with parallel batch (p-batch) processing
From MaRDI portal
Publication:2076906
DOI10.1016/j.ejor.2021.06.012zbMath1490.90125OpenAlexW3175546025MaRDI QIDQ2076906
Publication date: 22 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.06.012
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (17)
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 ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ 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 ⋮ Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ 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 ⋮ 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 ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ Online scheduling of two-machine flowshop with lookahead and incompatible job families
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Online over time scheduling on parallel-batch machines: a survey
- Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Makespan minimization in a no-wait flow shop problem with two batching machines
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Bicriterion scheduling with equal processing times on a batch processing machine
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Steady state results for the M/M(a,b)/c batch-service system
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Stochastic scheduling of a batch processing machine with incompatible job families
- Scheduling job shops with batch machines using the Lagrangian relaxation technique
- Dynamic scheduling on a single batch processing machine with split compatibility graphs
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Scheduling one batch processor subject to job release dates
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- A batch-oblivious approach for complex job-shop scheduling problems
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- Multiobjective scheduling of jobs with incompatible families on parallel batch machines
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Makespan minimization on single batch-processing machine via ant colony optimization
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Bi-objective scheduling on a restricted batching machine
- Minimizing due date related performance measures on two batch processing machines
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- A constraint programming approach for a batch processing problem with non-identical job sizes
- A brief history of linear and mixed-integer programming computation
- Earliness and tardiness scheduling problems on a batch processor
- Scheduling with batching: A review
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- CP and hybrid models for two-stage batching and scheduling
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Mixed batch scheduling on identical machines
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
- Minimizing total completion time on a batch processing machine with job families
- Improved MILP models for two-machine flowshop with batch processing machines
- Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
- Bounded parallel-batching scheduling with two competing agents
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Taxonomy of batch queueing models in manufacturing systems
- Arc-flow approach for single batch-processing machine scheduling
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- No-Wait Scheduling Problems with Batching Machines
- Solving single batch-processing machine problems using an iterated heuristic
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance
- Optimization by GRASP
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Principles of Constraint Programming
- Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study
- The Batch Loading and Scheduling Problem
- The Price of Robustness
- Single- and multiple-processor models for minimizing completion time variance
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Approximations for Product Departures from a Single-Server Station with Batch Processing in Multi-Product Queues
- A Multiserver Queue with Thresholds for the Acceptance of Customers into Service
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Heuristic scheduling of jobs on a multi-product batch processing machine
- Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Control of a batch-processing machine: A computational approach
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a single batch processing machine with non-identical job sizes
- The use of upstream and downstream information in scheduling semiconductor batch operations
- Scheduling batch processing machines with incompatible job families
- Some simple scheduling algorithms
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Scheduling a batch processing machine with non-identical job sizes
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Optimal batching in a wafer fabrication facility using a multiproduct G/G/c model with batch processing
- Heuristics for minimizing total weighted tardiness in complex job shops
- Rescheduling strategies for minimizing total weighted tardiness in complex job shops
- Scheduling Groups of Jobs on a Single Machine
- Integrated scheduling on parallel batch processing machines with non-identical capacities
- Learning effective dispatching rules for batch processor scheduling
- Multiagent Scheduling
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- 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
- A Primer in Column Generation
- A General Class of Bulk Queues with Poisson Input
- Multilevel Bulk Service Queues
- Optimal control of batch service queues
- Two-Server Bulk-Service Queuing Process
- Scheduling
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Variable neighborhood search: Principles and applications
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey of scheduling with parallel batch (p-batch) processing
