Pages that link to "Item:Q266826"
From MaRDI portal
The following pages link to Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826):
Displaying 17 items.
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine (Q2182772) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
- Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
- A new model and algorithm for uncertain random parallel machine scheduling problem (Q2318555) (← links)
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) (← links)
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
- Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights (Q4600100) (← links)
- Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow (Q4632969) (← links)
- Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection (Q6050607) (← links)
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)