Pages that link to "Item:Q4022932"
From MaRDI portal
The following pages link to Batching and Scheduling Jobs on Batch and Discrete Processors (Q4022932):
Displayed 14 items.
- Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
- A constant-factor approximation algorithm for multi-vehicle collection for processing problem (Q376011) (← links)
- Heuristics for parallel machine scheduling with batch delivery consideration (Q380563) (← links)
- Batch sequencing and cooperation (Q398862) (← links)
- A two stage scheduling with transportation and batching (Q456105) (← links)
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
- Controlling job arrivals with processing time windows into batch processor buffer (Q763114) (← links)
- A hybrid two-stage transportation and batch scheduling problem (Q838180) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- A note on the complexity of flow shop scheduling with transportation constraints (Q859706) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- Model approximation for batch flow shop scheduling with fixed batch sizes (Q896496) (← links)
- Multiple orders per job batch scheduling with incompatible jobs (Q940891) (← links)
- The coordination of transportation and batching scheduling (Q965544) (← links)