Pages that link to "Item:Q765334"
From MaRDI portal
The following pages link to Scheduling an unbounded batching machine with job processing time compatibilities (Q765334):
Displaying 10 items.
- Optimal methods for batch processing problem with makespan and maximum lateness objectives (Q967805) (← links)
- Stochastic scheduling of a batch processing machine with incompatible job families (Q1374434) (← links)
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
- Batch scheduling on uniform machines to minimize total flow-time (Q1762004) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
- Busy time scheduling on a bounded number of machines (extended abstract) (Q2405306) (← links)
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint (Q2657417) (← links)