Scheduling with agreeable release times and due dates on a batch processing machine
From MaRDI portal
Recommendations
- Scheduling with Agreeable Release Times and Due Dates on a Single Continuous Batch Processing Machine
- Scheduling a burn-in oven with non-agreeable release times and due dates
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Efficient scheduling algorithms for a single batch processing machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Cites work
- A polynomial algorithm for a one machine batching problem
- Batch sizing and job sequencing on a single machine
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Batching in single operation manufacturing systems
- Batching to Minimize Flow Times on One Machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Minimizing total completion time on a batch processing machine with job families
- One-pass batching algorithms for the one-machine problem
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Survey of scheduling research involving due date determination decisions
Cited in
(37)- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- Scheduling a burn-in oven with non-agreeable release times and due dates
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Scheduling jobs with release dates on parallel batch processing machines
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A new dynamic look-ahead scheduling procedure for batching machines
- On scheduling an unbounded batch machine
- Minimizing due date related performance measures on two batch processing machines
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Earliness and tardiness scheduling problems on a batch processor
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- A survey of scheduling with parallel batch (p-batch) processing
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- MIP formulations and heuristics for solving parallel batching problems
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Scheduling on a batch processing machine with split compatibility graphs
- Just-in-time single-batch-processing machine scheduling
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- scientific article; zbMATH DE number 6830974 (Why is no real title available?)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- The bounded batch scheduling with common due window and non-identical size jobs
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- Scheduling with Agreeable Release Times and Due Dates on a Single Continuous Batch Processing Machine
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- 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
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
- Batch machine production with perishability time windows and limited batch size
- Dynamic batching of online arrivals to leverage economies of scale
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Controlling job arrivals with processing time windows into batch processor buffer
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- 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
This page was built for publication: Scheduling with agreeable release times and due dates on a batch processing machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278533)
