Efficient scheduling algorithms for a single batch processing machine
From MaRDI portal
Recommendations
- Minimizing makespan in batch machine scheduling
- scientific article; zbMATH DE number 2080262
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- scientific article; zbMATH DE number 6830974
- Scheduling problems on parallel identical unbounded batch processing machines
Cites work
Cited in
(87)- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
- scientific article; zbMATH DE number 5671136 (Why is no real title available?)
- Arc-flow approach for single batch-processing machine scheduling
- A bi-criteria optimization model for medical device sterilization
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- A new dynamic look-ahead scheduling procedure for batching machines
- Composing batches with yield uncertainty
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Learning effective dispatching rules for batch processor scheduling
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm
- The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs
- Scheduling a proportionate flow shop of batching machines
- scientific article; zbMATH DE number 2080262 (Why is no real title available?)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- Scheduling one batch processor subject to job release dates
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
- Parallel batching with multi-size jobs and incompatible job families
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Exact approaches for single machine total weighted tardiness batch scheduling
- Integrated production and delivery on parallel batching machines
- Integrated scheduling on parallel batch processing machines with non-identical capacities
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- A two stage scheduling with transportation and batching
- Scheduling jobs with release dates on parallel batch processing machines
- Scheduling tasks to minimize active time on a processor with unlimited capacity
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- On-line scheduling algorithms for a batch machine with finite capacity
- Parallel batch scheduling of equal-length jobs with release and due dates
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- Batch machine production with perishability time windows and limited batch size
- Minimizing due date related performance measures on two batch processing machines
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- Mixed batch scheduling on identical machines
- Batch scheduling of nonidentical job sizes with minsum criteria
- Makespan minimization on single batch-processing machine via ant colony optimization
- Heuristic scheduling of jobs on a multi-product batch processing machine
- Scheduling with families of jobs and delivery coordination under job availability
- Earliness and tardiness scheduling problems on a batch processor
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Dynamic scheduling of batch servers with compatible product families
- Bicriterion scheduling with equal processing times on a batch processing machine
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Controlling job arrivals with processing time windows into batch processor buffer
- Scheduling with agreeable release times and due dates on a batch processing machine
- A survey of scheduling with parallel batch (p-batch) processing
- Scheduling with Agreeable Release Times and Due Dates on a Single Continuous Batch Processing Machine
- Co-scheduling algorithms for high-throughput workload execution
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Minimizing total completion time on a batch processing machine with job families
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Scheduling on a batch processing machine with split compatibility graphs
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm
- MIP formulations and heuristics for solving parallel batching problems
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
This page was built for publication: Efficient scheduling algorithms for a single batch processing machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077325)