Pages that link to "Item:Q2183850"
From MaRDI portal
The following pages link to Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850):
Displaying 15 items.
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Weighted completion time minimization for capacitated parallel machines (Q2085744) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
- An efficient approximation algorithm for minimizing makespan on uniformly related machines. (Q2775886) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines (Q6065642) (← links)
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
- A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines (Q6588490) (← links)
