Scheduling with agreeable release times and due dates on a batch processing machine
From MaRDI portal
Publication:1278533
DOI10.1016/0377-2217(95)00332-0zbMath0929.90038OpenAlexW2082642933MaRDI QIDQ1278533
Publication date: 27 April 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00332-0
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Case-oriented studies in operations research (90B90)
Related Items
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 ⋮ Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals ⋮ Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Batch machine production with perishability time windows and limited batch size ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ Earliness and tardiness scheduling problems on a batch processor ⋮ A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines ⋮ The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ Minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ Mixed integer formulation to minimize makespan in a flow shop with batch processing machines ⋮ Minimizing number of tardy jobs on a batch processing machine with incompatible job families ⋮ 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 ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Scheduling jobs with agreeable processing times and due dates on a single batch processing machine ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ Controlling job arrivals with processing time windows into batch processor buffer ⋮ 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 ⋮ Scheduling on a batch processing machine with split compatibility graphs ⋮ A new dynamic look-ahead scheduling procedure for batching machines ⋮ On scheduling an unbounded batch machine
Cites Work
- Unnamed Item
- Batch sizing and job sequencing on a single machine
- Batching in single operation manufacturing systems
- Efficient scheduling algorithms for a single batch processing machine
- Survey of scheduling research involving due date determination decisions
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
- Minimizing total completion time on a batch processing machine with job families
- Batching to Minimize Flow Times on One Machine
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
