Pages that link to "Item:Q1652061"
From MaRDI portal
The following pages link to Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061):
Displaying 17 items.
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (Q1651526) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- Scheduling unrelated additive manufacturing machines with practical constraints (Q2147124) (← links)
- Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing (Q2668671) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
- Integrated scheduling on parallel batch processing machines with non-identical capacities (Q5059346) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines (Q6065642) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints (Q6551068) (← links)
- Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm (Q6551161) (← links)