A survey of scheduling with parallel batch (p-batch) processing (Q2076906)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A survey of scheduling with parallel batch (p-batch) processing

scientific article; zbMATH DE number 7478878

Language	Label	Description	Also known as
default for all languages	No label defined
English	A survey of scheduling with parallel batch (p-batch) processing	scientific article; zbMATH DE number 7478878

Statements

instance of

scholarly article

0 references

title

A survey of scheduling with parallel batch (p-batch) processing (English)

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

22 February 2022

0 references

zbMATH Keywords

scheduling

0 references

parallel batch processing

0 references

survey

0 references

semiconductor manufacturing

0 references

future research directions

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2021.06.012

0 references

cites work

The Shifting Bottleneck Procedure for Job Shop Scheduling

0 references

Multiagent scheduling. Models and algorithms

0 references

Batching and Scheduling Jobs on Batch and Discrete Processors

0 references

Principles of Constraint Programming

0 references

Two-Server Bulk-Service Queuing Process

0 references

Control of a batch-processing machine: A computational approach

0 references

Scheduling a batch processing machine with non-identical job sizes

0 references

Multilevel Bulk Service Queues

0 references

Q5827377

0 references

Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness

0 references

Branch-and-price: Column generation for solving huge integer programs

0 references

Genetic Algorithms and Random Keys for Sequencing and Optimization

0 references

Scheduling hybrid flowshop with parallel batching machines and compatibilities

0 references

The Price of Robustness

0 references

Approximations for Product Departures from a Single-Server Station with Batch Processing in Multi-Product Queues

0 references

A brief history of linear and mixed-integer programming computation

0 references

Dynamic scheduling on a single batch processing machine with split compatibility graphs

0 references

Scheduling on a batch machine with job compatibilities

0 references

Scheduling a batching machine

0 references

Bi-objective scheduling on a restricted batching machine

0 references

Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance

0 references

Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints

0 references

Minimizing total completion time on a batch processing machine with job families

0 references

Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices

0 references

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

0 references

Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

0 references

Q3347319

0 references

Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

0 references

Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective

0 references

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

0 references

Optimal control of batch service queues

0 references

A Primer in Column Generation

0 references

Q4789914

0 references

The Batch Loading and Scheduling Problem

0 references

Ant colony optimization.

0 references

Stochastic scheduling of a batch processing machine with incompatible job families

0 references

Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

0 references

Q3793928

0 references

Q4289899

0 references

Bounded parallel-batching scheduling with two competing agents

0 references

Heuristic scheduling of jobs on a multi-product batch processing machine

0 references

Optimal batching in a wafer fabrication facility using a multiproduct G/G/c model with batch processing

0 references

A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan

0 references

Learning effective dispatching rules for batch processor scheduling

0 references

Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach

0 references

Q4354785

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Single- and multiple-processor models for minimizing completion time variance

0 references

Flexible job shop scheduling problem for parallel batch processing machine with compatible job families

0 references

Variable neighborhood search: Principles and applications

0 references

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost

0 references

Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

0 references

Some simple scheduling algorithms

0 references

Efficient scheduling algorithms for a single batch processing machine

0 references

Integrated scheduling on parallel batch processing machines with non-identical capacities

0 references

An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

0 references

A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes

0 references

Minimizing number of tardy jobs on a batch processing machine with incompatible job families

0 references

Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints

0 references

Q4821818

0 references

A weighted modified due date rule for sequencing to minimize weighted tardiness

0 references

Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework

0 references

A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

0 references

Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes

0 references

Optimization by simulated annealing

0 references

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

0 references

Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families

0 references

Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times

0 references

Minimizing makespan on a single batch processing machine with dynamic job arrivals

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

Q4194705

0 references

Scheduling with agreeable release times and due dates on a batch processing machine

0 references

Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families

0 references

Improved MILP models for two-machine flowshop with batch processing machines

0 references

Bicriterion scheduling with equal processing times on a batch processing machine

0 references

On the complexity of bi-criteria scheduling on a single batch processing machine

0 references

Scheduling jobs with agreeable processing times and due dates on a single batch processing machine

0 references

Scheduling one batch processor subject to job release dates

0 references

A constraint programming approach for a batch processing problem with non-identical job sizes

0 references

A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

0 references

A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops

0 references

Heuristics for minimizing total weighted tardiness in complex job shops

0 references

Rescheduling strategies for minimizing total weighted tardiness in complex job shops

0 references

Q4873721

0 references

Q4398828

0 references

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

0 references

Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops

0 references

Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

0 references

Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint

0 references

Exact algorithms to minimize makespan on single and parallel batch processing machines

0 references

A General Class of Bulk Queues with Poisson Input

0 references

A Multiserver Queue with Thresholds for the Acceptance of Customers into Service

0 references

Makespan minimization in a no-wait flow shop problem with two batching machines

0 references

No-wait scheduling problems with batching machines

0 references

A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes

0 references

Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system

0 references

Minimizing total weighted tardiness on a single batch process machine with incompatible job families

0 references

A multi-criteria approach for scheduling semiconductor wafer fabrication facilities

0 references

Scheduling. Theory, algorithms, and systems

0 references

Scheduling with batching: A review

0 references

Differential evolution. A practical approach to global optimization. With CD-ROM.

0 references

Earliness and tardiness scheduling problems on a batch processor

0 references

Multiobjective scheduling of jobs with incompatible families on parallel batch machines

0 references

Optimization by GRASP. Greedy randomized adaptive search procedures

0 references

The use of upstream and downstream information in scheduling semiconductor batch operations

0 references

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

0 references

A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates

0 references

Steady state results for the M/M(a,b)/c batch-service system

0 references

Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication

0 references

Minimizing makespan on a single burn-in oven in semiconductor manufacturing

0 references

Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals

0 references

Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

0 references

Minimizing due date related performance measures on two batch processing machines

0 references

A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines

0 references

Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

0 references

A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines

0 references

Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

0 references

CP and hybrid models for two-stage batching and scheduling

0 references

A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times

0 references

Online over time scheduling on parallel-batch machines: a survey

0 references

Arc-flow approach for single batch-processing machine scheduling

0 references

Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study

0 references

Scheduling a single batch processing machine with non-identical job sizes

0 references

Scheduling batch processing machines with incompatible job families

0 references

Dynamic scheduling of batch-processing machines with non-identical product sizes

0 references

Dynamic job assignment heuristics for multi-server batch operations- A cost based approach

0 references

Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families

0 references

Q3378954

0 references

Solving single batch-processing machine problems using an iterated heuristic

0 references

Scheduling job shops with batch machines using the Lagrangian relaxation technique

0 references

Mixed batch scheduling on identical machines

0 references

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

0 references

Scheduling Groups of Jobs on a Single Machine

0 references

Taxonomy of batch queueing models in manufacturing systems

0 references

Makespan minimization on single batch-processing machine via ant colony optimization

0 references

Scheduling parallel-machine batch operations to maximize on-time delivery performance

0 references

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

0 references

Identifiers

zbMATH Open document ID

1490.90125

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2021.06.012

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2076906