Pages that link to "Item:Q2488201"
From MaRDI portal
The following pages link to Minimizing flow-time on a single machine with integer batch sizes (Q2488201):
Displaying 27 items.
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem (Q398915) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- Lot scheduling on a single machine (Q402382) (← links)
- Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
- Batch scheduling of identical jobs on parallel identical machines (Q456112) (← links)
- A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253) (← links)
- Batch sizing and job sequencing on a single machine (Q749439) (← links)
- Single machine scheduling with batch-dependent setup times (Q844160) (← links)
- Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
- Single machine lot scheduling to minimize the total weighted (discounted) completion time (Q1628686) (← links)
- A note on a single-machine lot scheduling problem with indivisible orders (Q1652143) (← links)
- Minimizing the maximum flow time in batch scheduling (Q1709967) (← links)
- Minimizing flowtime for paired tasks (Q1751895) (← links)
- Batch scheduling on uniform machines to minimize total flow-time (Q1762004) (← links)
- Single machine lot scheduling with non-uniform lot capacities and processing times (Q2156300) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- A single machine batch scheduling problem with bounded batch size (Q2467253) (← links)
- Open-shop batch scheduling with identical jobs (Q2467272) (← links)
- Single machine batch scheduling with non-increasing time slot costs (Q2673533) (← links)
- Batching to Minimize Flow Times on One Machine (Q3026726) (← links)
- A BATCHING PROBLEM WITH LEARNING EFFECT CONSIDERATIONS (Q3636505) (← links)
- On Minimizing Flow Time on Processors with Variable Unit Processing Time (Q3755220) (← links)
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)
