Pages that link to "Item:Q266826"

The following pages link to Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826):

Displaying 9 items.

• 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-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)
• A new model and algorithm for uncertain random parallel machine scheduling problem (Q2318555) (← links)
• Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)