Unbounded parallel-batch scheduling to minimize the total weighted tardy span
From MaRDI portal
Cites work
- A note on unbounded parallel-batch scheduling
- A performance comparison and evaluation of metaheuristics for a batch scheduling problem in a multi-hybrid cell manufacturing system with skilled workforce assignment
- A stochastic model and social optimization of a blockchain system based on a general limited batch service queue
- An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
- Batching machine scheduling with bicriteria: maximum cost and makespan
- Bi-criteria scheduling on a single parallel-batch machine
- Bi-objective scheduling on a restricted batching machine
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Hierarchical optimization on an unbounded parallel-batching machine
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing mean completion time in a batch processing system
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- On scheduling an unbounded batch machine
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
- Parallel-batch scheduling with deterioration and rejection on a single machine
- Scheduling a batching machine
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- Single machine parallel batch scheduling subject to precedence constraints
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
- Unbounded parallel-batch scheduling with drop-line tasks
This page was built for publication: Unbounded parallel-batch scheduling to minimize the total weighted tardy span
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851844)
