Pages that link to "Item:Q2741217"
From MaRDI portal
The following pages link to Minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2741217):
Displaying 37 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Integrated production and delivery on parallel batching machines (Q320081) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
- Optimally competitive list batching (Q837154) (← links)
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes (Q1029348) (← links)
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart (Q1666180) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs (Q1698887) (← links)
- Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms (Q1735170) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
- Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← links)
- A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (Q2109294) (← links)
- Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance (Q2156319) (← links)
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine (Q2182772) (← links)
- Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
- Approximation schemes for scheduling a batching machine with nonidentical job size (Q2425843) (← links)
- Minimizing makespan on a single batching machine with release times and non-identical job sizes (Q2488218) (← links)
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125) (← links)
- SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK (Q4921478) (← links)
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes (Q5172586) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
