Pages that link to "Item:Q4510514"
From MaRDI portal
The following pages link to Scheduling a batch processing machine with non-identical job sizes (Q4510514):
Displayed 19 items.
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times (Q1762129) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
- Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- An effective formulation for optimal scheduling of multistage multi-product batch plant based on due dates (Q3163750) (← links)
- Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← links)
- A hybrid neural network approach to minimize total completion time on a single batch processing machine (Q6092620) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)