Pages that link to "Item:Q3421855"
From MaRDI portal
The following pages link to MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855):
Displaying 15 items.
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines (Q459788) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- A best online algorithm for scheduling on two parallel batch machines (Q1019748) (← links)
- Minimizing the sum of job completion times on capacitated parallel machines (Q1339850) (← links)
- Improved algorithms to minimize workload balancing criteria on identical parallel machines (Q1652586) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems (Q2312337) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
- Minimizing total completion time on a batching machine with job processing time compatibilities (Q2861568) (← links)
- (Q4782744) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel (Q5438523) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
